java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc /storage/repos/ultimate/trunk/examples/toolchains/ReqCheck.xml -s /storage/repos/ultimate/trunk/examples/settings/reqanalyzer/reqanalyzer-nonlin.epf --traceabstraction.limit.analysis.time 300 --pea2boogie.always.use.all.invariants.during.rt-inconsistency.checks true --pea2boogie.check.vacuity true --pea2boogie.check.consistency true --pea2boogie.check.rt-inconsistency true --pea2boogie.report.trivial.rt-consistency false --pea2boogie.rt-inconsistency.range 2 -i /storage/repos/re2019-exp/hybrid2_extended.new.req -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a613b84 [2019-04-04 17:46:49,679 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-04-04 17:46:49,681 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-04-04 17:46:49,692 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-04-04 17:46:49,693 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-04-04 17:46:49,694 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-04-04 17:46:49,695 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-04-04 17:46:49,697 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-04-04 17:46:49,698 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-04-04 17:46:49,699 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-04-04 17:46:49,700 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-04-04 17:46:49,700 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-04-04 17:46:49,701 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-04-04 17:46:49,702 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-04-04 17:46:49,704 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-04-04 17:46:49,704 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-04-04 17:46:49,705 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-04-04 17:46:49,707 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-04-04 17:46:49,709 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-04-04 17:46:49,711 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-04-04 17:46:49,712 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-04-04 17:46:49,714 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-04-04 17:46:49,716 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-04-04 17:46:49,717 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-04-04 17:46:49,717 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-04-04 17:46:49,718 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-04-04 17:46:49,718 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-04-04 17:46:49,720 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-04-04 17:46:49,720 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-04-04 17:46:49,721 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-04-04 17:46:49,722 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-04-04 17:46:49,722 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-04-04 17:46:49,724 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-04-04 17:46:49,724 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-04-04 17:46:49,725 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-04-04 17:46:49,725 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-04-04 17:46:49,725 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-04-04 17:46:49,726 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-04-04 17:46:49,727 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-04-04 17:46:49,727 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/trunk/examples/settings/reqanalyzer/reqanalyzer-nonlin.epf [2019-04-04 17:46:49,738 INFO L110 SettingsManager]: Loading preferences was successful [2019-04-04 17:46:49,739 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-04-04 17:46:49,740 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-04-04 17:46:49,740 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2019-04-04 17:46:49,740 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-04-04 17:46:49,741 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:12000 [2019-04-04 17:46:49,741 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-04-04 17:46:49,741 INFO L133 SettingsManager]: * Trace refinement exception blacklist=UNKNOWN [2019-04-04 17:46:49,741 INFO L133 SettingsManager]: * Stop after first violation was found=false [2019-04-04 17:46:49,741 INFO L133 SettingsManager]: * Compute statistics for interpolant sequences=false [2019-04-04 17:46:49,742 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM [2019-04-04 17:46:49,742 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-04-04 17:46:49,742 INFO L133 SettingsManager]: * Compute trace for counterexample result=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit analysis time -> 300 Applying setting for plugin de.uni_freiburg.informatik.ultimate.pea2boogie: Always use all invariants during rt-inconsistency checks -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.pea2boogie: Check vacuity -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.pea2boogie: Check consistency -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.pea2boogie: Check rt-inconsistency -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.pea2boogie: Report trivial rt-consistency -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.pea2boogie: Rt-inconsistency range -> 2 [2019-04-04 17:46:49,787 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-04-04 17:46:49,799 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-04-04 17:46:49,802 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-04-04 17:46:49,805 INFO L271 PluginConnector]: Initializing ReqParser... [2019-04-04 17:46:49,806 INFO L276 PluginConnector]: ReqParser initialized [2019-04-04 17:46:49,807 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/re2019-exp/hybrid2_extended.new.req [2019-04-04 17:46:49,807 INFO L94 ReqParser]: Parsing file /storage/repos/re2019-exp/hybrid2_extended.new.req [2019-04-04 17:46:49,865 INFO L134 ReqParser]: 23 requirements (15 non-initialization) in total [2019-04-04 17:46:49,870 INFO L134 ReqParser]: 23 requirements (15 non-initialization) after unification [2019-04-04 17:46:49,876 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-04-04 17:46:49,877 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-04-04 17:46:49,878 INFO L113 PluginConnector]: ------------------------PEA to Boogie---------------------------- [2019-04-04 17:46:49,878 INFO L271 PluginConnector]: Initializing PEA to Boogie... [2019-04-04 17:46:49,879 INFO L276 PluginConnector]: PEA to Boogie initialized [2019-04-04 17:46:49,881 INFO L185 PluginConnector]: Executing the observer PEAtoBoogieObserver from plugin PEA to Boogie for "de.uni_freiburg.informatik.ultimate.reqparser OTHER 04.04 05:46:49" (1/1) ... [2019-04-04 17:46:49,890 INFO L157 Req2BoogieTranslator]: Check vacuity=true, Rt-inconsistency range=2, Check consistency=true, Report trivial rt-consistency=false, Always use all invariants during rt-inconsistency checks=true [2019-04-04 17:46:49,906 INFO L59 ReqToPEA]: Transforming 15 requirements to PEAs [2019-04-04 17:46:49,966 INFO L87 ReqToPEA]: Following types of requirements were processed [2019-04-04 17:46:49,966 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.BndResponsePatternUT : 5 [2019-04-04 17:46:49,966 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.MinDurationPattern : 2 [2019-04-04 17:46:49,967 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.MaxDurationPattern : 5 [2019-04-04 17:46:49,967 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.PrecedencePattern : 1 [2019-04-04 17:46:49,967 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.BndInvariancePattern : 2 [2019-04-04 17:46:49,967 INFO L92 ReqToPEA]: Finished transforming 15 requirements to PEAs No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-04-04 17:46:50,196 INFO L154 cyConditionGenerator]: Finished generating primed state invariant of size 1 [2019-04-04 17:46:50,212 WARN L496 Req2BoogieTranslator]: phase without clock or state invariant for ID011: Globally, it is always the case that if "x0004" holds, then "x0003", previously held [2019-04-04 17:46:50,219 INFO L769 Req2BoogieTranslator]: 0 of 15 requirements are invariant [2019-04-04 17:46:50,221 INFO L786 Req2BoogieTranslator]: Computing rt-inconsistency assertions for 105 subsets [2019-04-04 17:46:50,987 INFO L284 cyConditionGenerator]: 105 checks, 71 trivial consistent, 34 non-trivial [2019-04-04 17:46:50,987 INFO L290 cyConditionGenerator]: Of 1636 formulas, 0 were quantified, 1636 were plain. Needed 364 quantifier elimination runs, 0 quantified solver queries. [2019-04-04 17:46:51,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:51 Unit [2019-04-04 17:46:51,010 INFO L132 PluginConnector]: ------------------------ END PEA to Boogie---------------------------- [2019-04-04 17:46:51,011 INFO L113 PluginConnector]: ------------------------Boogie Printer---------------------------- [2019-04-04 17:46:51,011 INFO L271 PluginConnector]: Initializing Boogie Printer... [2019-04-04 17:46:51,011 INFO L276 PluginConnector]: Boogie Printer initialized [2019-04-04 17:46:51,012 INFO L185 PluginConnector]: Executing the observer BoogiePrinterObserver from plugin Boogie Printer for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:51" (1/1) ... [2019-04-04 17:46:51,013 INFO L116 oogiePrinterObserver]: File already exists and will be overwritten: /tmp/boogiePrinter.bpl [2019-04-04 17:46:51,013 INFO L120 oogiePrinterObserver]: Writing to file /tmp/boogiePrinter.bpl [2019-04-04 17:46:51,041 INFO L132 PluginConnector]: ------------------------ END Boogie Printer---------------------------- [2019-04-04 17:46:51,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-04-04 17:46:51,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-04-04 17:46:51,041 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-04-04 17:46:51,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:51" (1/1) ... [2019-04-04 17:46:51,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:51" (1/1) ... [2019-04-04 17:46:51,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:51" (1/1) ... [2019-04-04 17:46:51,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:51" (1/1) ... [2019-04-04 17:46:51,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:51" (1/1) ... [2019-04-04 17:46:51,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:51" (1/1) ... [2019-04-04 17:46:51,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:51" (1/1) ... [2019-04-04 17:46:51,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-04-04 17:46:51,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-04-04 17:46:51,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-04-04 17:46:51,172 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-04-04 17:46:51,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-04-04 17:46:51,182 INFO L124 BoogieDeclarations]: Specification and implementation of procedure myProcedure given in one single declaration [2019-04-04 17:46:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure myProcedure [2019-04-04 17:46:51,182 INFO L138 BoogieDeclarations]: Found implementation of procedure myProcedure Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:12000 [2019-04-04 17:46:56,220 INFO L278 CfgBuilder]: Using library mode [2019-04-04 17:46:56,220 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-04-04 17:46:56,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 05:46:56 BoogieIcfgContainer [2019-04-04 17:46:56,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-04-04 17:46:56,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-04-04 17:46:56,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-04-04 17:46:56,226 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-04-04 17:46:56,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.reqparser OTHER 04.04 05:46:49" (1/3) ... [2019-04-04 17:46:56,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70006451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 04.04 05:46:56, skipping insertion in model container [2019-04-04 17:46:56,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:51" (2/3) ... [2019-04-04 17:46:56,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70006451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 05:46:56, skipping insertion in model container [2019-04-04 17:46:56,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 05:46:56" (3/3) ... [2019-04-04 17:46:56,229 INFO L112 eAbstractionObserver]: Analyzing ICFG [2019-04-04 17:46:56,238 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-04-04 17:46:56,245 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 50 error locations. [2019-04-04 17:46:56,263 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:56,285 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:56,285 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:56,286 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:56,286 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:56,286 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:56,286 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:56,286 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:56,287 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr23ASSERT_VIOLATIONRTINCONSISTENTforID014_ID012======== [2019-04-04 17:46:56,302 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:46:56,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-04-04 17:46:56,310 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:56,311 INFO L402 BasicCegarLoop]: 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, 1, 1, 1] [2019-04-04 17:46:56,311 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr23ASSERT_VIOLATIONRTINCONSISTENTforID014_ID012]=== [2019-04-04 17:46:56,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:56,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1144534551, now seen corresponding path program 1 times [2019-04-04 17:46:56,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:56,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:56,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:46:56,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:56,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:56,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:46:56,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:46:56,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:56,584 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:46:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:56,604 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:46:56,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:46:56,606 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2019-04-04 17:46:56,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:56,614 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:46:56,614 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:56,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:56,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:56,640 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-04-04 17:46:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:56,641 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:56,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:46:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:56,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:56,645 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr23ASSERT_VIOLATIONRTINCONSISTENTforID014_ID012 was SAFE (1/50) [2019-04-04 17:46:56,647 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:56,647 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:56,647 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:56,647 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:56,648 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:56,648 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:56,648 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:56,648 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:56,648 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID013_ID014======== [2019-04-04 17:46:56,651 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:46:56,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-04-04 17:46:56,652 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:56,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:46:56,653 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID013_ID014]=== [2019-04-04 17:46:56,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:56,653 INFO L82 PathProgramCache]: Analyzing trace with hash -684873661, now seen corresponding path program 1 times [2019-04-04 17:46:56,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:56,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:56,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:56,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:46:56,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:56,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:46:56,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:46:56,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:46:56,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:46:56,911 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 4 states. [2019-04-04 17:46:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:57,074 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-04-04 17:46:57,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 17:46:57,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-04-04 17:46:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:57,081 INFO L225 Difference]: With dead ends: 145 [2019-04-04 17:46:57,081 INFO L226 Difference]: Without dead ends: 104 [2019-04-04 17:46:57,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:46:57,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-04-04 17:46:57,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 63. [2019-04-04 17:46:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-04-04 17:46:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-04-04 17:46:57,096 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 11 [2019-04-04 17:46:57,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:57,096 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-04-04 17:46:57,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:46:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-04-04 17:46:57,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-04-04 17:46:57,098 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:57,099 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:46:57,099 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID013_ID014]=== [2019-04-04 17:46:57,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:57,099 INFO L82 PathProgramCache]: Analyzing trace with hash -878339166, now seen corresponding path program 1 times [2019-04-04 17:46:57,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:57,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:57,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:57,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:57,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:57,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-04 17:46:57,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:57,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:46:57,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 17:46:57,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 17:46:57,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:46:57,312 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 3 states. [2019-04-04 17:46:57,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:57,350 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-04-04 17:46:57,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 17:46:57,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-04-04 17:46:57,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:57,352 INFO L225 Difference]: With dead ends: 62 [2019-04-04 17:46:57,352 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:57,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:46:57,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:57,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:57,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:57,354 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2019-04-04 17:46:57,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:57,354 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:57,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 17:46:57,355 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:57,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:57,355 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID013_ID014 was SAFE (2/50) [2019-04-04 17:46:57,356 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:57,357 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:57,357 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:57,357 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:57,357 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:57,357 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:57,357 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:57,357 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:57,358 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID013_ID010======== [2019-04-04 17:46:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:46:57,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-04-04 17:46:57,361 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:57,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:46:57,361 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID013_ID010]=== [2019-04-04 17:46:57,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:57,362 INFO L82 PathProgramCache]: Analyzing trace with hash 243753353, now seen corresponding path program 1 times [2019-04-04 17:46:57,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:57,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:57,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:57,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:57,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:46:57,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:57,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:57,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:46:57,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:46:57,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:57,390 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:46:57,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:57,394 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:46:57,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:46:57,394 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-04-04 17:46:57,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:57,395 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:46:57,395 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:57,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:57,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:57,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:57,396 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-04-04 17:46:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:57,396 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:57,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:46:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:57,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:57,397 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID013_ID010 was SAFE (3/50) [2019-04-04 17:46:57,398 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:57,398 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:57,398 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:57,398 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:57,398 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:57,399 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:57,399 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:57,399 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:57,399 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID002_ID011======== [2019-04-04 17:46:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:46:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-04-04 17:46:57,402 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:57,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-04-04 17:46:57,402 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID002_ID011]=== [2019-04-04 17:46:57,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:57,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1448180989, now seen corresponding path program 1 times [2019-04-04 17:46:57,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:57,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:57,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:57,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:57,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:57,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:46:57,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:57,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:46:57,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:46:57,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:46:57,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:46:57,554 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 4 states. [2019-04-04 17:46:57,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:57,670 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-04-04 17:46:57,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:46:57,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-04-04 17:46:57,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:57,672 INFO L225 Difference]: With dead ends: 146 [2019-04-04 17:46:57,672 INFO L226 Difference]: Without dead ends: 104 [2019-04-04 17:46:57,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:46:57,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-04-04 17:46:57,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 58. [2019-04-04 17:46:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-04-04 17:46:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-04-04 17:46:57,679 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 6 [2019-04-04 17:46:57,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:57,680 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-04-04 17:46:57,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:46:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-04-04 17:46:57,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-04-04 17:46:57,681 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:57,682 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:46:57,682 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID002_ID011]=== [2019-04-04 17:46:57,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:57,682 INFO L82 PathProgramCache]: Analyzing trace with hash -426397628, now seen corresponding path program 1 times [2019-04-04 17:46:57,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:57,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:57,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:57,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:57,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:58,102 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 14 [2019-04-04 17:46:58,299 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 12 [2019-04-04 17:46:58,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:46:58,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:46:58,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-04-04 17:46:58,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:58,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 9 conjunts are in the unsatisfiable core [2019-04-04 17:46:58,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:46:58,900 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2019-04-04 17:47:00,296 WARN L188 SmtUtils]: Spent 905.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-04-04 17:47:00,779 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2019-04-04 17:47:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:00,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:47:00,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-04-04 17:47:00,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-04-04 17:47:00,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-04-04 17:47:00,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-04-04 17:47:00,803 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 10 states. [2019-04-04 17:47:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:00,890 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-04-04 17:47:00,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-04 17:47:00,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-04-04 17:47:00,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:00,892 INFO L225 Difference]: With dead ends: 103 [2019-04-04 17:47:00,892 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:00,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-04-04 17:47:00,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:00,893 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-04-04 17:47:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:00,894 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:00,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-04-04 17:47:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:00,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:00,895 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID002_ID011 was SAFE (4/50) [2019-04-04 17:47:00,895 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:00,896 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:00,896 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:00,896 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:00,896 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:00,896 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:00,896 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:00,896 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:00,897 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr27ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010======== [2019-04-04 17:47:00,898 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:00,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-04-04 17:47:00,899 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:00,899 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:00,899 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr27ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010]=== [2019-04-04 17:47:00,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:00,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1663724827, now seen corresponding path program 1 times [2019-04-04 17:47:00,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:00,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:00,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:00,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:00,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:00,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:00,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:47:00,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:47:00,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:47:00,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:00,925 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:47:00,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:00,927 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:47:00,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:47:00,927 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2019-04-04 17:47:00,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:00,928 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:47:00,928 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:00,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:00,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:00,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:00,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:00,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:00,929 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-04-04 17:47:00,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:00,929 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:00,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:47:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:00,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:00,930 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr27ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010 was SAFE (5/50) [2019-04-04 17:47:00,931 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:00,931 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:00,931 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:00,931 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:00,931 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:00,931 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:00,932 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:00,932 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:00,932 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr38ASSERT_VIOLATIONVACUOUSforID014======== [2019-04-04 17:47:00,933 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:00,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-04-04 17:47:00,934 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:00,935 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:00,935 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr38ASSERT_VIOLATIONVACUOUSforID014]=== [2019-04-04 17:47:00,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:00,935 INFO L82 PathProgramCache]: Analyzing trace with hash -411065439, now seen corresponding path program 1 times [2019-04-04 17:47:00,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:00,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:00,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:00,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:00,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:01,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:01,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:47:01,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 17:47:01,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 17:47:01,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:47:01,040 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 3 states. [2019-04-04 17:47:01,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:01,130 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-04-04 17:47:01,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 17:47:01,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-04-04 17:47:01,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:01,132 INFO L225 Difference]: With dead ends: 145 [2019-04-04 17:47:01,133 INFO L226 Difference]: Without dead ends: 104 [2019-04-04 17:47:01,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:47:01,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-04-04 17:47:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2019-04-04 17:47:01,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-04-04 17:47:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-04-04 17:47:01,151 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 41 [2019-04-04 17:47:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:01,151 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-04-04 17:47:01,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 17:47:01,154 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-04-04 17:47:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-04-04 17:47:01,160 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,160 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:01,160 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr38ASSERT_VIOLATIONVACUOUSforID014]=== [2019-04-04 17:47:01,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1439783232, now seen corresponding path program 1 times [2019-04-04 17:47:01,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:47:01,233 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:47:01,240 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr38ASSERT_VIOLATIONVACUOUSforID014 was UNSAFE (6/50) [2019-04-04 17:47:01,240 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:01,241 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:01,241 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:01,241 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:01,241 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:01,241 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:01,241 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:01,241 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:01,242 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr21ASSERT_VIOLATIONRTINCONSISTENTforID014_ID007======== [2019-04-04 17:47:01,245 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:01,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-04-04 17:47:01,247 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,247 INFO L402 BasicCegarLoop]: 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, 1] [2019-04-04 17:47:01,247 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr21ASSERT_VIOLATIONRTINCONSISTENTforID014_ID007]=== [2019-04-04 17:47:01,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1672697493, now seen corresponding path program 1 times [2019-04-04 17:47:01,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:01,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:01,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:47:01,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:47:01,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:47:01,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,279 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:47:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:01,280 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:47:01,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:47:01,280 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2019-04-04 17:47:01,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:01,283 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:47:01,283 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:01,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:01,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:01,284 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-04-04 17:47:01,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:01,284 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:01,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:47:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:01,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:01,285 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr21ASSERT_VIOLATIONRTINCONSISTENTforID014_ID007 was SAFE (7/50) [2019-04-04 17:47:01,287 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:01,287 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:01,287 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:01,288 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:01,288 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:01,288 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:01,288 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:01,288 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:01,288 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr34ASSERT_VIOLATIONVACUOUSforID002======== [2019-04-04 17:47:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-04-04 17:47:01,290 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,293 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:01,293 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr34ASSERT_VIOLATIONVACUOUSforID002]=== [2019-04-04 17:47:01,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1215859229, now seen corresponding path program 1 times [2019-04-04 17:47:01,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:47:01,319 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:47:01,320 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr34ASSERT_VIOLATIONVACUOUSforID002 was UNSAFE (8/50) [2019-04-04 17:47:01,320 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:01,321 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:01,321 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:01,321 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:01,321 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:01,321 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:01,321 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:01,321 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:01,322 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr39ASSERT_VIOLATIONVACUOUSforID009======== [2019-04-04 17:47:01,325 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-04-04 17:47:01,326 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,326 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:01,326 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr39ASSERT_VIOLATIONVACUOUSforID009]=== [2019-04-04 17:47:01,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,326 INFO L82 PathProgramCache]: Analyzing trace with hash 141873703, now seen corresponding path program 1 times [2019-04-04 17:47:01,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:47:01,348 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:47:01,349 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr39ASSERT_VIOLATIONVACUOUSforID009 was UNSAFE (9/50) [2019-04-04 17:47:01,350 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:01,350 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:01,350 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:01,350 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:01,351 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:01,351 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:01,351 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:01,351 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:01,351 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr18ASSERT_VIOLATIONRTINCONSISTENTforID014_ID006======== [2019-04-04 17:47:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-04-04 17:47:01,354 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:01,354 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr18ASSERT_VIOLATIONRTINCONSISTENTforID014_ID006]=== [2019-04-04 17:47:01,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,355 INFO L82 PathProgramCache]: Analyzing trace with hash 987620365, now seen corresponding path program 1 times [2019-04-04 17:47:01,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:01,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:01,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:47:01,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:47:01,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:47:01,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,383 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:47:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:01,387 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:47:01,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:47:01,387 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2019-04-04 17:47:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:01,388 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:47:01,388 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:01,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:01,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:01,391 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-04-04 17:47:01,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:01,392 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:01,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:47:01,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:01,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:01,393 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr18ASSERT_VIOLATIONRTINCONSISTENTforID014_ID006 was SAFE (10/50) [2019-04-04 17:47:01,398 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:01,398 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:01,398 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:01,398 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:01,399 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:01,399 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:01,399 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:01,399 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:01,399 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr42ASSERT_VIOLATIONVACUOUSforID003======== [2019-04-04 17:47:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-04-04 17:47:01,401 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,401 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:01,402 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr42ASSERT_VIOLATIONVACUOUSforID003]=== [2019-04-04 17:47:01,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,402 INFO L82 PathProgramCache]: Analyzing trace with hash 312089893, now seen corresponding path program 1 times [2019-04-04 17:47:01,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:47:01,416 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:47:01,417 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr42ASSERT_VIOLATIONVACUOUSforID003 was UNSAFE (11/50) [2019-04-04 17:47:01,419 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:01,419 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:01,419 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:01,419 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:01,420 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:01,421 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:01,421 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:01,421 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:01,421 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr28ASSERT_VIOLATIONRTINCONSISTENTforID003_ID010======== [2019-04-04 17:47:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-04-04 17:47:01,423 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,423 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:01,424 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr28ASSERT_VIOLATIONRTINCONSISTENTforID003_ID010]=== [2019-04-04 17:47:01,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,424 INFO L82 PathProgramCache]: Analyzing trace with hash 35862487, now seen corresponding path program 1 times [2019-04-04 17:47:01,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:01,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:01,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:47:01,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:47:01,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:47:01,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,455 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:47:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:01,456 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:47:01,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:47:01,456 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2019-04-04 17:47:01,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:01,457 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:47:01,457 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:01,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:01,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:01,459 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-04-04 17:47:01,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:01,459 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:01,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:47:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:01,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:01,460 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr28ASSERT_VIOLATIONRTINCONSISTENTforID003_ID010 was SAFE (12/50) [2019-04-04 17:47:01,461 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:01,461 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:01,461 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:01,461 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:01,461 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:01,461 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:01,461 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:01,462 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:01,462 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr41ASSERT_VIOLATIONVACUOUSforID011======== [2019-04-04 17:47:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:01,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-04-04 17:47:01,464 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,464 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:01,464 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr41ASSERT_VIOLATIONVACUOUSforID011]=== [2019-04-04 17:47:01,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1098311255, now seen corresponding path program 1 times [2019-04-04 17:47:01,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:47:01,479 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:47:01,483 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr41ASSERT_VIOLATIONVACUOUSforID011 was UNSAFE (13/50) [2019-04-04 17:47:01,483 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:01,485 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:01,485 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:01,485 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:01,485 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:01,485 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:01,485 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:01,485 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:01,486 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr22ASSERT_VIOLATIONRTINCONSISTENTforID014_ID000======== [2019-04-04 17:47:01,487 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-04-04 17:47:01,487 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,487 INFO L402 BasicCegarLoop]: 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, 1, 1] [2019-04-04 17:47:01,487 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr22ASSERT_VIOLATIONRTINCONSISTENTforID014_ID000]=== [2019-04-04 17:47:01,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,488 INFO L82 PathProgramCache]: Analyzing trace with hash 314015121, now seen corresponding path program 1 times [2019-04-04 17:47:01,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:01,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:01,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:47:01,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:47:01,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:47:01,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,512 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:47:01,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:01,513 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:47:01,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:47:01,514 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2019-04-04 17:47:01,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:01,514 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:47:01,514 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:01,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:01,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:01,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:01,516 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-04-04 17:47:01,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:01,516 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:01,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:47:01,517 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:01,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:01,517 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr22ASSERT_VIOLATIONRTINCONSISTENTforID014_ID000 was SAFE (14/50) [2019-04-04 17:47:01,518 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:01,518 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:01,518 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:01,518 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:01,519 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:01,519 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:01,519 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:01,519 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:01,519 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID014_ID003======== [2019-04-04 17:47:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:01,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-04-04 17:47:01,521 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,521 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:01,522 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID014_ID003]=== [2019-04-04 17:47:01,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,522 INFO L82 PathProgramCache]: Analyzing trace with hash -106688623, now seen corresponding path program 1 times [2019-04-04 17:47:01,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:01,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:01,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:47:01,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:47:01,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:47:01,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,548 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:47:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:01,549 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:47:01,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:47:01,549 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2019-04-04 17:47:01,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:01,550 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:47:01,550 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:01,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:01,560 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-04-04 17:47:01,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:01,560 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:01,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:47:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:01,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:01,561 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID014_ID003 was SAFE (15/50) [2019-04-04 17:47:01,563 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:01,564 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:01,564 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:01,564 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:01,564 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:01,564 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:01,564 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:01,564 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:01,565 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr25ASSERT_VIOLATIONRTINCONSISTENTforID005_ID010======== [2019-04-04 17:47:01,566 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:01,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-04-04 17:47:01,566 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,567 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1] [2019-04-04 17:47:01,567 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr25ASSERT_VIOLATIONRTINCONSISTENTforID005_ID010]=== [2019-04-04 17:47:01,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,568 INFO L82 PathProgramCache]: Analyzing trace with hash 386088345, now seen corresponding path program 1 times [2019-04-04 17:47:01,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:01,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:01,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:47:01,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:47:01,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:47:01,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,591 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:47:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:01,595 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:47:01,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:47:01,595 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2019-04-04 17:47:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:01,596 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:47:01,596 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:01,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:01,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:01,597 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-04-04 17:47:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:01,597 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:01,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:47:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:01,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:01,599 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr25ASSERT_VIOLATIONRTINCONSISTENTforID005_ID010 was SAFE (16/50) [2019-04-04 17:47:01,599 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:01,600 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:01,600 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:01,600 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:01,600 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:01,600 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:01,600 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:01,600 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:01,600 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID002_ID004======== [2019-04-04 17:47:01,601 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:01,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-04-04 17:47:01,602 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-04-04 17:47:01,602 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID002_ID004]=== [2019-04-04 17:47:01,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,602 INFO L82 PathProgramCache]: Analyzing trace with hash 95547, now seen corresponding path program 1 times [2019-04-04 17:47:01,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:01,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:01,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:47:01,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 17:47:01,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 17:47:01,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:47:01,755 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 3 states. [2019-04-04 17:47:01,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:01,777 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-04-04 17:47:01,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 17:47:01,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-04-04 17:47:01,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:01,778 INFO L225 Difference]: With dead ends: 73 [2019-04-04 17:47:01,778 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:01,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:47:01,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:01,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:01,780 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 [2019-04-04 17:47:01,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:01,780 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:01,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 17:47:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:01,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:01,781 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID002_ID004 was SAFE (17/50) [2019-04-04 17:47:01,782 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:01,782 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:01,782 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:01,782 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:01,782 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:01,782 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:01,782 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:01,783 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:01,783 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr49ASSERT_VIOLATIONCONSISTENCYforallrequirements======== [2019-04-04 17:47:01,784 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-04-04 17:47:01,784 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,785 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:01,785 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr49ASSERT_VIOLATIONCONSISTENCYforallrequirements]=== [2019-04-04 17:47:01,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1940899761, now seen corresponding path program 1 times [2019-04-04 17:47:01,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:47:01,798 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:47:01,799 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr49ASSERT_VIOLATIONCONSISTENCYforallrequirements was UNSAFE (18/50) [2019-04-04 17:47:01,799 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:01,799 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:01,799 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:01,800 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:01,800 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:01,800 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:01,800 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:01,800 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:01,800 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID014_ID009======== [2019-04-04 17:47:01,801 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:01,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-04-04 17:47:01,801 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:01,802 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID014_ID009]=== [2019-04-04 17:47:01,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1921493641, now seen corresponding path program 1 times [2019-04-04 17:47:01,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:01,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:01,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:47:01,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:47:01,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:47:01,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,821 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:47:01,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:01,822 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:47:01,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:47:01,822 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-04-04 17:47:01,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:01,822 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:47:01,822 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:01,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:01,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:01,823 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-04-04 17:47:01,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:01,824 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:01,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:47:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:01,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:01,824 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID014_ID009 was SAFE (19/50) [2019-04-04 17:47:01,825 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:01,825 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:01,825 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:01,826 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:01,826 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:01,826 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:01,826 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:01,826 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:01,826 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID002_ID014======== [2019-04-04 17:47:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-04-04 17:47:01,827 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-04-04 17:47:01,828 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID002_ID014]=== [2019-04-04 17:47:01,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,828 INFO L82 PathProgramCache]: Analyzing trace with hash 91831805, now seen corresponding path program 1 times [2019-04-04 17:47:01,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:01,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:01,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:01,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:47:01,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:47:01,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:47:01,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,846 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:47:01,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:01,847 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:47:01,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:47:01,847 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-04-04 17:47:01,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:01,847 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:47:01,847 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:01,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:01,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:01,848 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-04-04 17:47:01,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:01,849 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:01,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:47:01,849 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:01,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:01,849 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID002_ID014 was SAFE (20/50) [2019-04-04 17:47:01,850 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:01,850 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:01,850 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:01,850 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:01,851 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:01,851 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:01,851 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:01,851 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:01,851 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID004_ID014======== [2019-04-04 17:47:01,852 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:01,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-04-04 17:47:01,852 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:01,853 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID004_ID014]=== [2019-04-04 17:47:01,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,853 INFO L82 PathProgramCache]: Analyzing trace with hash -132515195, now seen corresponding path program 1 times [2019-04-04 17:47:01,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:01,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:01,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:47:01,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:47:01,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:47:01,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,871 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:47:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:01,872 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:47:01,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:47:01,873 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-04-04 17:47:01,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:01,873 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:47:01,873 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:01,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:01,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:01,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:01,874 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-04-04 17:47:01,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:01,874 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:01,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:47:01,875 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:01,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:01,875 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID004_ID014 was SAFE (21/50) [2019-04-04 17:47:01,876 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:01,876 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:01,876 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:01,876 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:01,876 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:01,876 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:01,877 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:01,877 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:01,877 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID014_ID005======== [2019-04-04 17:47:01,878 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:01,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-04-04 17:47:01,878 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:01,878 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID014_ID005]=== [2019-04-04 17:47:01,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,879 INFO L82 PathProgramCache]: Analyzing trace with hash -563238897, now seen corresponding path program 1 times [2019-04-04 17:47:01,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:01,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:01,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:47:01,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:47:01,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:47:01,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,896 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:47:01,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:01,897 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:47:01,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:47:01,897 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-04-04 17:47:01,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:01,898 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:47:01,898 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:01,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:01,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:01,899 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-04-04 17:47:01,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:01,899 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:01,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:47:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:01,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:01,900 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID014_ID005 was SAFE (22/50) [2019-04-04 17:47:01,900 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:01,901 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:01,901 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:01,901 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:01,901 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:01,901 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:01,901 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:01,901 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:01,901 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr35ASSERT_VIOLATIONVACUOUSforID004======== [2019-04-04 17:47:01,902 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-04-04 17:47:01,903 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,903 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:01,903 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr35ASSERT_VIOLATIONVACUOUSforID004]=== [2019-04-04 17:47:01,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,903 INFO L82 PathProgramCache]: Analyzing trace with hash -963069149, now seen corresponding path program 1 times [2019-04-04 17:47:01,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:47:01,913 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:47:01,914 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr35ASSERT_VIOLATIONVACUOUSforID004 was UNSAFE (23/50) [2019-04-04 17:47:01,914 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:01,914 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:01,915 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:01,915 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:01,915 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:01,915 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:01,915 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:01,915 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:01,915 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID002_ID008======== [2019-04-04 17:47:01,916 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:01,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-04-04 17:47:01,916 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:01,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-04-04 17:47:01,917 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID002_ID008]=== [2019-04-04 17:47:01,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:01,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2962305, now seen corresponding path program 1 times [2019-04-04 17:47:01,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:01,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:01,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:01,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:02,064 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-04-04 17:47:02,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:02,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:02,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:47:02,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 17:47:02,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 17:47:02,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:47:02,065 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 3 states. [2019-04-04 17:47:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:02,128 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-04-04 17:47:02,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 17:47:02,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-04-04 17:47:02,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:02,129 INFO L225 Difference]: With dead ends: 73 [2019-04-04 17:47:02,129 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:02,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:47:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:02,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:02,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-04-04 17:47:02,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:02,130 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:02,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 17:47:02,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:02,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:02,131 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID002_ID008 was SAFE (24/50) [2019-04-04 17:47:02,131 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:02,131 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:02,131 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:02,131 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:02,131 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:02,132 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:02,132 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:02,132 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:02,132 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID014_ID011======== [2019-04-04 17:47:02,133 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:02,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-04-04 17:47:02,133 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:02,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:02,133 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID014_ID011]=== [2019-04-04 17:47:02,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:02,134 INFO L82 PathProgramCache]: Analyzing trace with hash -280536245, now seen corresponding path program 1 times [2019-04-04 17:47:02,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:02,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:02,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:02,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:02,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:02,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:02,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:47:02,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:47:02,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:47:02,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:02,152 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:47:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:02,153 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:47:02,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:47:02,153 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-04-04 17:47:02,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:02,153 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:47:02,153 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:02,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:02,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:02,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:02,154 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-04-04 17:47:02,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:02,155 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:02,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:47:02,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:02,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:02,155 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID014_ID011 was SAFE (25/50) [2019-04-04 17:47:02,156 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:02,156 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:02,156 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:02,156 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:02,157 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:02,157 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:02,157 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:02,157 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:02,157 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID008_ID014======== [2019-04-04 17:47:02,158 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:02,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-04-04 17:47:02,158 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:02,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:02,158 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID008_ID014]=== [2019-04-04 17:47:02,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:02,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1976217333, now seen corresponding path program 1 times [2019-04-04 17:47:02,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:02,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:02,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:02,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:02,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:02,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:02,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:47:02,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:47:02,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:47:02,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:02,179 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:47:02,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:02,180 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:47:02,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:47:02,180 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-04-04 17:47:02,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:02,181 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:47:02,181 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:02,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:02,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:02,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:02,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:02,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:02,182 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2019-04-04 17:47:02,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:02,182 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:02,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:47:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:02,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:02,185 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID008_ID014 was SAFE (26/50) [2019-04-04 17:47:02,186 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:02,186 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:02,186 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:02,186 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:02,186 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:02,186 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:02,186 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:02,187 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:02,187 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr45ASSERT_VIOLATIONVACUOUSforID001======== [2019-04-04 17:47:02,188 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:02,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-04-04 17:47:02,190 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:02,190 INFO L402 BasicCegarLoop]: 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, 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] [2019-04-04 17:47:02,191 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr45ASSERT_VIOLATIONVACUOUSforID001]=== [2019-04-04 17:47:02,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:02,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1133764435, now seen corresponding path program 1 times [2019-04-04 17:47:02,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:02,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:02,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:02,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:02,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:47:02,210 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:47:02,211 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr45ASSERT_VIOLATIONVACUOUSforID001 was UNSAFE (27/50) [2019-04-04 17:47:02,211 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:02,211 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:02,212 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:02,212 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:02,212 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:02,212 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:02,212 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:02,212 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:02,212 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr19ASSERT_VIOLATIONRTINCONSISTENTforID014_ID010======== [2019-04-04 17:47:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:02,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-04-04 17:47:02,216 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:02,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:02,216 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr19ASSERT_VIOLATIONRTINCONSISTENTforID014_ID010]=== [2019-04-04 17:47:02,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:02,216 INFO L82 PathProgramCache]: Analyzing trace with hash 551460627, now seen corresponding path program 1 times [2019-04-04 17:47:02,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:02,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:02,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:02,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:02,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:02,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:02,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:47:02,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:47:02,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:47:02,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:02,236 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:47:02,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:02,237 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:47:02,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:47:02,238 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2019-04-04 17:47:02,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:02,238 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:47:02,238 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:02,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:02,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:02,239 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-04-04 17:47:02,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:02,239 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:02,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:47:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:02,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:02,240 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr19ASSERT_VIOLATIONRTINCONSISTENTforID014_ID010 was SAFE (28/50) [2019-04-04 17:47:02,241 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:02,241 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:02,241 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:02,241 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:02,241 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:02,241 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:02,241 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:02,241 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:02,242 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr33ASSERT_VIOLATIONRTINCONSISTENTforID010_ID012======== [2019-04-04 17:47:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-04-04 17:47:02,244 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:02,244 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:02,245 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr33ASSERT_VIOLATIONRTINCONSISTENTforID010_ID012]=== [2019-04-04 17:47:02,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:02,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1009052577, now seen corresponding path program 1 times [2019-04-04 17:47:02,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:02,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:02,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:02,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:02,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:02,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:02,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:02,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:47:02,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:47:02,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:47:02,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:02,270 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:47:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:02,271 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:47:02,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:47:02,271 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2019-04-04 17:47:02,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:02,271 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:47:02,271 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:02,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:02,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:02,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:02,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:02,272 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2019-04-04 17:47:02,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:02,273 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:02,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:47:02,273 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:02,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:02,273 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr33ASSERT_VIOLATIONRTINCONSISTENTforID010_ID012 was SAFE (29/50) [2019-04-04 17:47:02,274 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:02,274 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:02,274 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:02,274 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:02,274 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:02,274 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:02,274 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:02,275 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:02,276 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr32ASSERT_VIOLATIONRTINCONSISTENTforID010_ID000======== [2019-04-04 17:47:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-04-04 17:47:02,277 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:02,277 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:02,277 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr32ASSERT_VIOLATIONRTINCONSISTENTforID010_ID000]=== [2019-04-04 17:47:02,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:02,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1279476059, now seen corresponding path program 1 times [2019-04-04 17:47:02,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:02,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:02,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:02,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:02,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:02,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:02,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:02,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:47:02,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:47:02,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:47:02,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:02,298 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:47:02,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:02,299 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:47:02,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:47:02,299 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 35 [2019-04-04 17:47:02,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:02,300 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:47:02,300 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:47:02,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:47:02,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:47:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:47:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:47:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:47:02,301 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-04-04 17:47:02,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:02,301 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:47:02,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:47:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:47:02,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:47:02,302 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr32ASSERT_VIOLATIONRTINCONSISTENTforID010_ID000 was SAFE (30/50) [2019-04-04 17:47:02,303 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:47:02,304 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:47:02,304 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:47:02,304 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:47:02,304 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:47:02,305 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:47:02,305 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:47:02,305 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:47:02,305 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr40ASSERT_VIOLATIONVACUOUSforID005======== [2019-04-04 17:47:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:47:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-04-04 17:47:02,306 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:02,306 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:02,306 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr40ASSERT_VIOLATIONVACUOUSforID005]=== [2019-04-04 17:47:02,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:02,307 INFO L82 PathProgramCache]: Analyzing trace with hash 103117923, now seen corresponding path program 1 times [2019-04-04 17:47:02,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:02,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:02,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:02,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:02,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:02,529 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-04-04 17:47:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:02,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:47:02,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:47:02,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:47:02,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:47:02,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:47:02,649 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 4 states. [2019-04-04 17:47:03,062 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2019-04-04 17:47:03,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:03,197 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-04-04 17:47:03,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:47:03,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-04-04 17:47:03,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:03,200 INFO L225 Difference]: With dead ends: 146 [2019-04-04 17:47:03,200 INFO L226 Difference]: Without dead ends: 104 [2019-04-04 17:47:03,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:47:03,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-04-04 17:47:03,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2019-04-04 17:47:03,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-04-04 17:47:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-04-04 17:47:03,217 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 43 [2019-04-04 17:47:03,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:03,218 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-04-04 17:47:03,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:47:03,218 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-04-04 17:47:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-04-04 17:47:03,219 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:03,219 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:47:03,219 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr40ASSERT_VIOLATIONVACUOUSforID005]=== [2019-04-04 17:47:03,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:03,219 INFO L82 PathProgramCache]: Analyzing trace with hash -652203070, now seen corresponding path program 1 times [2019-04-04 17:47:03,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:03,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:03,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:03,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:03,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:03,855 WARN L188 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2019-04-04 17:47:04,014 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 13 [2019-04-04 17:47:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:04,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:47:04,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-04-04 17:47:04,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:04,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 13 conjunts are in the unsatisfiable core [2019-04-04 17:47:04,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:47:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:04,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:47:04,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-04-04 17:47:04,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-04-04 17:47:04,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-04-04 17:47:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-04-04 17:47:04,511 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 8 states. [2019-04-04 17:47:04,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:47:04,821 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-04-04 17:47:04,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-04 17:47:04,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-04-04 17:47:04,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:47:04,824 INFO L225 Difference]: With dead ends: 155 [2019-04-04 17:47:04,824 INFO L226 Difference]: Without dead ends: 155 [2019-04-04 17:47:04,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-04-04 17:47:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-04-04 17:47:04,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 146. [2019-04-04 17:47:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-04-04 17:47:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-04-04 17:47:04,833 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 94 [2019-04-04 17:47:04,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:47:04,834 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-04-04 17:47:04,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-04-04 17:47:04,834 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-04-04 17:47:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-04-04 17:47:04,835 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:47:04,835 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-04-04 17:47:04,836 INFO L423 AbstractCegarLoop]: === Iteration 3 === [myProcedureErr40ASSERT_VIOLATIONVACUOUSforID005]=== [2019-04-04 17:47:04,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:47:04,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1637965315, now seen corresponding path program 2 times [2019-04-04 17:47:04,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:47:04,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:47:04,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:04,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:04,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:47:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:06,160 WARN L188 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-04-04 17:47:06,781 WARN L188 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 45 [2019-04-04 17:47:07,859 WARN L188 SmtUtils]: Spent 983.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 85 [2019-04-04 17:47:08,355 WARN L188 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 56 [2019-04-04 17:47:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:47:08,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:47:08,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-04-04 17:47:08,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:47:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:47:08,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 43 conjunts are in the unsatisfiable core [2019-04-04 17:47:08,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:47:19,617 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-04-04 17:47:19,733 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 17712 conjuctions. This might take some time... [2019-04-04 17:47:50,501 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 17712 conjuctions. [2019-04-04 17:48:32,837 WARN L188 SmtUtils]: Spent 41.30 s on a formula simplification. DAG size of input: 1387 DAG size of output: 40 [2019-04-04 17:48:35,782 WARN L188 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 153 DAG size of output: 117 [2019-04-04 17:52:02,303 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-04-04 17:52:02,504 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:52:02,505 WARN L549 AbstractCegarLoop]: Verification canceled [2019-04-04 17:52:02,507 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr40ASSERT_VIOLATIONVACUOUSforID005 was TIMEOUT (31/50) [2019-04-04 17:52:02,509 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:02,509 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:02,509 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:02,509 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:02,509 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:02,510 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:02,510 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:02,510 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:02,510 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr46ASSERT_VIOLATIONVACUOUSforID007======== [2019-04-04 17:52:02,512 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:02,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-04-04 17:52:02,513 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:02,513 INFO L402 BasicCegarLoop]: 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, 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] [2019-04-04 17:52:02,514 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr46ASSERT_VIOLATIONVACUOUSforID007]=== [2019-04-04 17:52:02,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:02,514 INFO L82 PathProgramCache]: Analyzing trace with hash -786958679, now seen corresponding path program 1 times [2019-04-04 17:52:02,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:02,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:02,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:02,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:02,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:02,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:52:02,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:52:02,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 17:52:02,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 17:52:02,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:52:02,668 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 3 states. [2019-04-04 17:52:02,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:52:02,751 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-04-04 17:52:02,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 17:52:02,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-04-04 17:52:02,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:52:02,753 INFO L225 Difference]: With dead ends: 146 [2019-04-04 17:52:02,753 INFO L226 Difference]: Without dead ends: 104 [2019-04-04 17:52:02,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:52:02,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-04-04 17:52:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-04-04 17:52:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-04-04 17:52:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-04-04 17:52:02,771 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 49 [2019-04-04 17:52:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:52:02,771 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-04-04 17:52:02,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 17:52:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-04-04 17:52:02,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-04-04 17:52:02,772 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:02,772 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-04-04 17:52:02,776 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr46ASSERT_VIOLATIONVACUOUSforID007]=== [2019-04-04 17:52:02,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:02,776 INFO L82 PathProgramCache]: Analyzing trace with hash 912091848, now seen corresponding path program 1 times [2019-04-04 17:52:02,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:02,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:02,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:02,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:02,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:03,455 WARN L188 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-04-04 17:52:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:03,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:52:03,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-04-04 17:52:03,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:03,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 20 conjunts are in the unsatisfiable core [2019-04-04 17:52:03,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:52:04,278 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 13 [2019-04-04 17:52:04,512 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:04,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:52:04,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2019-04-04 17:52:04,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-04-04 17:52:04,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-04-04 17:52:04,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-04-04 17:52:04,541 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 7 states. [2019-04-04 17:52:04,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:52:04,835 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-04-04 17:52:04,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-04-04 17:52:04,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-04-04 17:52:04,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:52:04,837 INFO L225 Difference]: With dead ends: 155 [2019-04-04 17:52:04,837 INFO L226 Difference]: Without dead ends: 155 [2019-04-04 17:52:04,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-04-04 17:52:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-04-04 17:52:04,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2019-04-04 17:52:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-04-04 17:52:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-04-04 17:52:04,851 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 100 [2019-04-04 17:52:04,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:52:04,851 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-04-04 17:52:04,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-04-04 17:52:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-04-04 17:52:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-04-04 17:52:04,852 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:04,853 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1] [2019-04-04 17:52:04,853 INFO L423 AbstractCegarLoop]: === Iteration 3 === [myProcedureErr46ASSERT_VIOLATIONVACUOUSforID007]=== [2019-04-04 17:52:04,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:04,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2500681, now seen corresponding path program 2 times [2019-04-04 17:52:04,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:04,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:04,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:04,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:04,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:52:04,961 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:52:04,962 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr46ASSERT_VIOLATIONVACUOUSforID007 was UNSAFE (32/50) [2019-04-04 17:52:04,963 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:04,965 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:04,966 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:04,966 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:04,966 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:04,966 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:04,966 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:04,966 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:04,966 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID008_ID010======== [2019-04-04 17:52:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:04,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-04-04 17:52:04,968 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:04,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:52:04,968 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID008_ID010]=== [2019-04-04 17:52:04,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:04,968 INFO L82 PathProgramCache]: Analyzing trace with hash -769300339, now seen corresponding path program 1 times [2019-04-04 17:52:04,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:04,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:04,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:04,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:04,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:04,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:52:04,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:52:04,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:52:04,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:52:04,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:04,985 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:52:04,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:52:04,986 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:52:04,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:52:04,986 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-04-04 17:52:04,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:52:04,987 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:52:04,987 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:52:04,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:04,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:52:04,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:52:04,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:52:04,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:52:04,988 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2019-04-04 17:52:04,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:52:04,988 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:52:04,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:52:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:52:04,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:52:04,989 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID008_ID010 was SAFE (33/50) [2019-04-04 17:52:04,989 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:04,989 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:04,989 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:04,990 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:04,990 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:04,990 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:04,990 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:04,990 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:04,990 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr36ASSERT_VIOLATIONVACUOUSforID013======== [2019-04-04 17:52:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:04,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-04-04 17:52:04,991 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:04,992 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:52:04,992 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr36ASSERT_VIOLATIONVACUOUSforID013]=== [2019-04-04 17:52:04,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:04,992 INFO L82 PathProgramCache]: Analyzing trace with hash 209627871, now seen corresponding path program 1 times [2019-04-04 17:52:04,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:04,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:04,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:04,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:04,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:52:05,001 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:52:05,002 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr36ASSERT_VIOLATIONVACUOUSforID013 was UNSAFE (34/50) [2019-04-04 17:52:05,002 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:05,002 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:05,002 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:05,003 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:05,005 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:05,005 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:05,005 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:05,005 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:05,005 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr47ASSERT_VIOLATIONVACUOUSforID000======== [2019-04-04 17:52:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:05,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-04-04 17:52:05,007 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:05,007 INFO L402 BasicCegarLoop]: 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, 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] [2019-04-04 17:52:05,007 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr47ASSERT_VIOLATIONVACUOUSforID000]=== [2019-04-04 17:52:05,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:05,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1374085167, now seen corresponding path program 1 times [2019-04-04 17:52:05,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:05,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:05,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:05,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:52:05,016 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:52:05,016 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr47ASSERT_VIOLATIONVACUOUSforID000 was UNSAFE (35/50) [2019-04-04 17:52:05,017 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:05,017 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:05,017 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:05,017 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:05,017 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:05,017 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:05,018 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:05,018 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:05,018 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr44ASSERT_VIOLATIONVACUOUSforID010======== [2019-04-04 17:52:05,019 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-04-04 17:52:05,019 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:05,020 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:52:05,020 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr44ASSERT_VIOLATIONVACUOUSforID010]=== [2019-04-04 17:52:05,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:05,020 INFO L82 PathProgramCache]: Analyzing trace with hash -729309721, now seen corresponding path program 1 times [2019-04-04 17:52:05,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:05,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:05,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:05,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:05,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:52:05,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:52:05,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 17:52:05,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 17:52:05,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:52:05,130 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 3 states. [2019-04-04 17:52:05,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:52:05,211 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-04-04 17:52:05,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 17:52:05,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-04-04 17:52:05,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:52:05,212 INFO L225 Difference]: With dead ends: 146 [2019-04-04 17:52:05,213 INFO L226 Difference]: Without dead ends: 104 [2019-04-04 17:52:05,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:52:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-04-04 17:52:05,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2019-04-04 17:52:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-04-04 17:52:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-04-04 17:52:05,218 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 47 [2019-04-04 17:52:05,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:52:05,218 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-04-04 17:52:05,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 17:52:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-04-04 17:52:05,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-04-04 17:52:05,220 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:05,220 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:52:05,220 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr44ASSERT_VIOLATIONVACUOUSforID010]=== [2019-04-04 17:52:05,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:05,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1299608122, now seen corresponding path program 1 times [2019-04-04 17:52:05,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:05,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:05,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:05,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:52:05,257 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:52:05,258 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr44ASSERT_VIOLATIONVACUOUSforID010 was UNSAFE (36/50) [2019-04-04 17:52:05,259 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:05,259 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:05,259 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:05,259 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:05,259 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:05,259 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:05,259 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:05,259 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:05,259 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr20ASSERT_VIOLATIONRTINCONSISTENTforID014_ID001======== [2019-04-04 17:52:05,260 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-04-04 17:52:05,261 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:05,261 INFO L402 BasicCegarLoop]: 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] [2019-04-04 17:52:05,261 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr20ASSERT_VIOLATIONRTINCONSISTENTforID014_ID001]=== [2019-04-04 17:52:05,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:05,261 INFO L82 PathProgramCache]: Analyzing trace with hash -84589361, now seen corresponding path program 1 times [2019-04-04 17:52:05,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:05,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:05,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:05,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:05,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:52:05,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:52:05,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:52:05,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:52:05,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,276 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:52:05,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:52:05,277 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:52:05,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:52:05,277 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2019-04-04 17:52:05,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:52:05,278 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:52:05,278 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:52:05,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:52:05,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:52:05,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:52:05,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:52:05,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-04-04 17:52:05,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:52:05,279 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:52:05,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:52:05,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:52:05,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:52:05,280 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr20ASSERT_VIOLATIONRTINCONSISTENTforID014_ID001 was SAFE (37/50) [2019-04-04 17:52:05,280 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:05,280 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:05,280 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:05,281 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:05,281 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:05,281 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:05,281 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:05,281 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:05,281 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr30ASSERT_VIOLATIONRTINCONSISTENTforID010_ID001======== [2019-04-04 17:52:05,282 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:05,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-04-04 17:52:05,282 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:05,283 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:52:05,283 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr30ASSERT_VIOLATIONRTINCONSISTENTforID010_ID001]=== [2019-04-04 17:52:05,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:05,283 INFO L82 PathProgramCache]: Analyzing trace with hash 104124569, now seen corresponding path program 1 times [2019-04-04 17:52:05,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:05,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:05,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:05,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:05,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:52:05,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:52:05,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:52:05,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:52:05,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,298 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:52:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:52:05,299 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:52:05,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:52:05,299 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2019-04-04 17:52:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:52:05,299 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:52:05,299 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:52:05,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:52:05,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:52:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:52:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:52:05,300 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-04-04 17:52:05,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:52:05,300 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:52:05,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:52:05,300 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:52:05,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:52:05,301 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr30ASSERT_VIOLATIONRTINCONSISTENTforID010_ID001 was SAFE (38/50) [2019-04-04 17:52:05,301 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:05,302 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:05,302 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:05,302 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:05,302 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:05,302 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:05,302 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:05,302 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:05,302 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID013_ID012======== [2019-04-04 17:52:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-04-04 17:52:05,303 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:05,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:52:05,304 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID013_ID012]=== [2019-04-04 17:52:05,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:05,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1033580283, now seen corresponding path program 1 times [2019-04-04 17:52:05,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:05,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:05,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:05,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:05,467 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-04-04 17:52:05,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:05,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:52:05,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:52:05,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 17:52:05,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 17:52:05,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:52:05,469 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 3 states. [2019-04-04 17:52:05,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:52:05,544 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-04-04 17:52:05,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 17:52:05,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-04-04 17:52:05,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:52:05,545 INFO L225 Difference]: With dead ends: 73 [2019-04-04 17:52:05,545 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:52:05,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:52:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:52:05,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:52:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:52:05,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:52:05,546 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-04-04 17:52:05,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:52:05,546 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:52:05,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 17:52:05,547 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:52:05,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:52:05,547 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID013_ID012 was SAFE (39/50) [2019-04-04 17:52:05,548 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:05,548 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:05,548 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:05,548 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:05,548 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:05,548 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:05,548 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:05,549 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:05,549 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr37ASSERT_VIOLATIONVACUOUSforID008======== [2019-04-04 17:52:05,550 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:05,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-04-04 17:52:05,550 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:05,550 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:52:05,550 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr37ASSERT_VIOLATIONVACUOUSforID008]=== [2019-04-04 17:52:05,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:05,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2091470171, now seen corresponding path program 1 times [2019-04-04 17:52:05,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:05,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:05,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:05,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:52:05,559 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:52:05,560 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr37ASSERT_VIOLATIONVACUOUSforID008 was UNSAFE (40/50) [2019-04-04 17:52:05,560 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:05,561 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:05,561 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:05,561 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:05,561 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:05,561 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:05,561 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:05,561 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:05,561 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID004_ID010======== [2019-04-04 17:52:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:05,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-04-04 17:52:05,562 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:05,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:52:05,563 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID004_ID010]=== [2019-04-04 17:52:05,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:05,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1501927943, now seen corresponding path program 1 times [2019-04-04 17:52:05,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:05,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:05,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:05,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:05,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:52:05,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:52:05,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:52:05,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:52:05,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,576 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:52:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:52:05,577 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:52:05,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:52:05,577 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-04-04 17:52:05,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:52:05,577 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:52:05,578 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:52:05,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:52:05,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:52:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:52:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:52:05,578 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-04-04 17:52:05,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:52:05,579 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:52:05,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:52:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:52:05,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:52:05,579 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID004_ID010 was SAFE (41/50) [2019-04-04 17:52:05,580 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:05,580 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:05,580 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:05,580 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:05,580 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:05,581 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:05,581 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:05,581 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:05,581 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr48ASSERT_VIOLATIONVACUOUSforID012======== [2019-04-04 17:52:05,582 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:05,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-04-04 17:52:05,582 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:05,582 INFO L402 BasicCegarLoop]: 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, 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] [2019-04-04 17:52:05,583 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr48ASSERT_VIOLATIONVACUOUSforID012]=== [2019-04-04 17:52:05,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:05,583 INFO L82 PathProgramCache]: Analyzing trace with hash -353032341, now seen corresponding path program 1 times [2019-04-04 17:52:05,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:05,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:05,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:05,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:52:05,591 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:52:05,592 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr48ASSERT_VIOLATIONVACUOUSforID012 was UNSAFE (42/50) [2019-04-04 17:52:05,592 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:05,593 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:05,593 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:05,593 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:05,593 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:05,593 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:05,593 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:05,593 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:05,593 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID002_ID010======== [2019-04-04 17:52:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:05,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-04-04 17:52:05,595 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:05,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:52:05,595 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID002_ID010]=== [2019-04-04 17:52:05,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:05,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1943937345, now seen corresponding path program 1 times [2019-04-04 17:52:05,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:05,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:05,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:05,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:05,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:52:05,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:52:05,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:52:05,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:52:05,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,608 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:52:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:52:05,609 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:52:05,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:52:05,609 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2019-04-04 17:52:05,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:52:05,610 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:52:05,610 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:52:05,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:52:05,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:52:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:52:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:52:05,611 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-04-04 17:52:05,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:52:05,611 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:52:05,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:52:05,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:52:05,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:52:05,612 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID002_ID010 was SAFE (43/50) [2019-04-04 17:52:05,612 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:05,612 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:05,612 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:05,612 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:05,613 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:05,613 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:05,613 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:05,613 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:05,613 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr43ASSERT_VIOLATIONVACUOUSforID006======== [2019-04-04 17:52:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:05,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-04-04 17:52:05,614 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:05,614 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:52:05,615 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr43ASSERT_VIOLATIONVACUOUSforID006]=== [2019-04-04 17:52:05,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:05,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1084852523, now seen corresponding path program 1 times [2019-04-04 17:52:05,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:05,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:05,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:05,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:52:05,623 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:52:05,623 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr43ASSERT_VIOLATIONVACUOUSforID006 was UNSAFE (44/50) [2019-04-04 17:52:05,623 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:05,624 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:05,624 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:05,624 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:05,624 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:05,624 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:05,624 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:05,624 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:05,624 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr24ASSERT_VIOLATIONRTINCONSISTENTforID009_ID010======== [2019-04-04 17:52:05,625 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:05,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-04-04 17:52:05,626 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:05,626 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1] [2019-04-04 17:52:05,626 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr24ASSERT_VIOLATIONRTINCONSISTENTforID009_ID010]=== [2019-04-04 17:52:05,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:05,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1120833107, now seen corresponding path program 1 times [2019-04-04 17:52:05,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:05,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:05,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:05,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:05,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:52:05,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:52:05,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:52:05,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:52:05,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,640 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:52:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:52:05,641 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:52:05,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:52:05,641 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2019-04-04 17:52:05,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:52:05,642 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:52:05,642 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:52:05,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:52:05,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:52:05,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:52:05,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:52:05,643 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-04-04 17:52:05,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:52:05,643 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:52:05,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:52:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:52:05,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:52:05,644 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr24ASSERT_VIOLATIONRTINCONSISTENTforID009_ID010 was SAFE (45/50) [2019-04-04 17:52:05,644 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:05,644 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:05,644 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:05,645 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:05,645 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:05,645 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:05,645 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:05,645 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:05,645 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID004_ID003======== [2019-04-04 17:52:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:05,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-04-04 17:52:05,646 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:05,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:52:05,647 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID004_ID003]=== [2019-04-04 17:52:05,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:05,647 INFO L82 PathProgramCache]: Analyzing trace with hash 186996609, now seen corresponding path program 1 times [2019-04-04 17:52:05,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:05,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:05,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:05,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:05,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:52:05,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:52:05,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:52:05,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:52:05,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,661 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:52:05,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:52:05,662 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:52:05,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:52:05,662 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-04-04 17:52:05,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:52:05,662 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:52:05,662 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:52:05,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:52:05,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:52:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:52:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:52:05,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-04-04 17:52:05,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:52:05,663 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:52:05,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:52:05,664 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:52:05,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:52:05,664 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID004_ID003 was SAFE (46/50) [2019-04-04 17:52:05,664 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:05,665 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:05,665 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:05,665 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:05,665 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:05,665 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:05,665 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:05,665 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:05,665 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID008_ID003======== [2019-04-04 17:52:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-04-04 17:52:05,667 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:05,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:52:05,667 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID008_ID003]=== [2019-04-04 17:52:05,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:05,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1133194809, now seen corresponding path program 1 times [2019-04-04 17:52:05,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:05,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:05,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:05,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:05,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:52:05,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:52:05,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:52:05,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:52:05,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,681 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:52:05,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:52:05,682 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:52:05,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:52:05,682 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-04-04 17:52:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:52:05,682 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:52:05,682 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:52:05,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:52:05,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:52:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:52:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:52:05,683 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-04-04 17:52:05,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:52:05,683 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:52:05,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:52:05,684 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:52:05,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:52:05,684 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID008_ID003 was SAFE (47/50) [2019-04-04 17:52:05,684 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:05,685 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:05,685 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:05,685 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:05,685 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:05,685 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:05,685 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:05,685 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:05,685 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr29ASSERT_VIOLATIONRTINCONSISTENTforID006_ID010======== [2019-04-04 17:52:05,686 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:05,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-04-04 17:52:05,687 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:05,687 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:52:05,687 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr29ASSERT_VIOLATIONRTINCONSISTENTforID006_ID010]=== [2019-04-04 17:52:05,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:05,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1111737501, now seen corresponding path program 1 times [2019-04-04 17:52:05,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:05,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:05,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:05,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:05,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:52:05,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:52:05,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:52:05,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:52:05,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,702 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:52:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:52:05,703 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:52:05,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:52:05,703 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-04-04 17:52:05,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:52:05,703 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:52:05,703 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:52:05,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:52:05,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:52:05,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:52:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:52:05,704 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-04-04 17:52:05,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:52:05,704 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:52:05,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:52:05,705 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:52:05,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:52:05,705 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr29ASSERT_VIOLATIONRTINCONSISTENTforID006_ID010 was SAFE (48/50) [2019-04-04 17:52:05,705 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:05,706 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:05,706 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:05,706 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:05,706 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:05,706 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:05,706 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:05,706 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:05,706 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr31ASSERT_VIOLATIONRTINCONSISTENTforID010_ID007======== [2019-04-04 17:52:05,707 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:05,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-04-04 17:52:05,708 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:05,708 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:52:05,708 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr31ASSERT_VIOLATIONRTINCONSISTENTforID010_ID007]=== [2019-04-04 17:52:05,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:05,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1067105249, now seen corresponding path program 1 times [2019-04-04 17:52:05,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:05,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:05,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:05,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:05,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:52:05,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:52:05,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:52:05,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:52:05,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,722 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:52:05,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:52:05,723 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:52:05,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:52:05,723 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 34 [2019-04-04 17:52:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:52:05,724 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:52:05,724 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:52:05,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:52:05,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:52:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:52:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:52:05,725 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2019-04-04 17:52:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:52:05,725 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:52:05,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:52:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:52:05,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:52:05,726 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr31ASSERT_VIOLATIONRTINCONSISTENTforID010_ID007 was SAFE (49/50) [2019-04-04 17:52:05,726 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:52:05,726 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:52:05,726 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:52:05,726 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:52:05,726 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:52:05,727 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:52:05,727 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:52:05,727 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:52:05,727 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr26ASSERT_VIOLATIONRTINCONSISTENTforID011_ID003======== [2019-04-04 17:52:05,728 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-04 17:52:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-04-04 17:52:05,728 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:05,728 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2019-04-04 17:52:05,728 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr26ASSERT_VIOLATIONRTINCONSISTENTforID011_ID003]=== [2019-04-04 17:52:05,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:05,729 INFO L82 PathProgramCache]: Analyzing trace with hash -916162795, now seen corresponding path program 1 times [2019-04-04 17:52:05,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:05,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:05,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:05,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:05,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:52:05,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:52:05,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:52:05,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:52:05,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,742 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-04 17:52:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:52:05,743 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-04 17:52:05,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:52:05,743 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2019-04-04 17:52:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:52:05,744 INFO L225 Difference]: With dead ends: 74 [2019-04-04 17:52:05,744 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:52:05,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:52:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:52:05,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:52:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:52:05,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:52:05,745 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-04-04 17:52:05,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:52:05,745 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:52:05,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:52:05,745 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:52:05,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:52:05,746 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr26ASSERT_VIOLATIONRTINCONSISTENTforID011_ID003 was SAFE (50/50) [2019-04-04 17:52:05,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.04 05:52:05 BoogieIcfgContainer [2019-04-04 17:52:05,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-04-04 17:52:05,747 INFO L168 Benchmark]: Toolchain (without parser) took 315870.51 ms. Allocated memory was 141.6 MB in the beginning and 385.4 MB in the end (delta: 243.8 MB). Free memory was 107.8 MB in the beginning and 122.2 MB in the end (delta: -14.4 MB). Peak memory consumption was 229.4 MB. Max. memory is 7.1 GB. [2019-04-04 17:52:05,748 INFO L168 Benchmark]: ReqParser took 0.49 ms. Allocated memory is still 141.6 MB. Free memory was 110.1 MB in the beginning and 109.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-04-04 17:52:05,748 INFO L168 Benchmark]: PEA to Boogie took 1132.06 ms. Allocated memory was 141.6 MB in the beginning and 175.6 MB in the end (delta: 34.1 MB). Free memory was 107.8 MB in the beginning and 79.5 MB in the end (delta: 28.4 MB). Peak memory consumption was 62.4 MB. Max. memory is 7.1 GB. [2019-04-04 17:52:05,749 INFO L168 Benchmark]: Boogie Printer took 30.27 ms. Allocated memory is still 175.6 MB. Free memory was 79.5 MB in the beginning and 77.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-04-04 17:52:05,749 INFO L168 Benchmark]: Boogie Preprocessor took 129.92 ms. Allocated memory is still 175.6 MB. Free memory was 77.9 MB in the beginning and 74.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. [2019-04-04 17:52:05,750 INFO L168 Benchmark]: RCFGBuilder took 5050.52 ms. Allocated memory was 175.6 MB in the beginning and 234.9 MB in the end (delta: 59.2 MB). Free memory was 74.2 MB in the beginning and 88.7 MB in the end (delta: -14.5 MB). Peak memory consumption was 73.3 MB. Max. memory is 7.1 GB. [2019-04-04 17:52:05,750 INFO L168 Benchmark]: TraceAbstraction took 309523.82 ms. Allocated memory was 234.9 MB in the beginning and 385.4 MB in the end (delta: 150.5 MB). Free memory was 88.7 MB in the beginning and 122.2 MB in the end (delta: -33.5 MB). Peak memory consumption was 117.0 MB. Max. memory is 7.1 GB. [2019-04-04 17:52:05,754 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * ReqParser took 0.49 ms. Allocated memory is still 141.6 MB. Free memory was 110.1 MB in the beginning and 109.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * PEA to Boogie took 1132.06 ms. Allocated memory was 141.6 MB in the beginning and 175.6 MB in the end (delta: 34.1 MB). Free memory was 107.8 MB in the beginning and 79.5 MB in the end (delta: 28.4 MB). Peak memory consumption was 62.4 MB. Max. memory is 7.1 GB. * Boogie Printer took 30.27 ms. Allocated memory is still 175.6 MB. Free memory was 79.5 MB in the beginning and 77.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.92 ms. Allocated memory is still 175.6 MB. Free memory was 77.9 MB in the beginning and 74.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5050.52 ms. Allocated memory was 175.6 MB in the beginning and 234.9 MB in the end (delta: 59.2 MB). Free memory was 74.2 MB in the beginning and 88.7 MB in the end (delta: -14.5 MB). Peak memory consumption was 73.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 309523.82 ms. Allocated memory was 234.9 MB in the beginning and 385.4 MB in the end (delta: 150.5 MB). Free memory was 88.7 MB in the beginning and 122.2 MB in the end (delta: -33.5 MB). Peak memory consumption was 117.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ReqCheckSuccessResult [Line: -1]: Requirements ID014, ID012 are rt-consistent Requirements ID014, ID012 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr23ASSERT_VIOLATIONRTINCONSISTENTforID014_ID012 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.3s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID013, ID014 are rt-consistent Requirements ID013, ID014 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID013_ID014 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.7s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 122 SDtfs, 111 SDslu, 138 SDs, 0 SdLazy, 12 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 2 MinimizatonAttempts, 41 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 73 NumberOfCodeBlocks, 73 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 10/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID013, ID010 are rt-consistent Requirements ID013, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID013_ID010 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID002, ID011 are rt-consistent Requirements ID002, ID011 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID002_ID011 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 3.4s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 118 SDtfs, 571 SDslu, 231 SDs, 0 SdLazy, 30 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 2 MinimizatonAttempts, 46 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 7 NumberOfNonLiveVariables, 209 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID011, ID010 are rt-consistent Requirements ID011, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr27ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID014 is non-vacuous Requirement ID014 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr38ASSERT_VIOLATIONVACUOUSforID014 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 72 SDtfs, 31 SDslu, 69 SDs, 0 SdLazy, 6 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID014, ID007 are rt-consistent Requirements ID014, ID007 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr21ASSERT_VIOLATIONRTINCONSISTENTforID014_ID007 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID002 is non-vacuous Requirement ID002 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr34ASSERT_VIOLATIONVACUOUSforID002 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID009 is non-vacuous Requirement ID009 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr39ASSERT_VIOLATIONVACUOUSforID009 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID014, ID006 are rt-consistent Requirements ID014, ID006 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr18ASSERT_VIOLATIONRTINCONSISTENTforID014_ID006 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID003 is non-vacuous Requirement ID003 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr42ASSERT_VIOLATIONVACUOUSforID003 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID003, ID010 are rt-consistent Requirements ID003, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr28ASSERT_VIOLATIONRTINCONSISTENTforID003_ID010 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID011 is non-vacuous Requirement ID011 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr41ASSERT_VIOLATIONVACUOUSforID011 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID014, ID000 are rt-consistent Requirements ID014, ID000 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr22ASSERT_VIOLATIONRTINCONSISTENTforID014_ID000 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID014, ID003 are rt-consistent Requirements ID014, ID003 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID014_ID003 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID005, ID010 are rt-consistent Requirements ID005, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr25ASSERT_VIOLATIONRTINCONSISTENTforID005_ID010 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID002, ID004 are rt-consistent Requirements ID002, ID004 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID002_ID004 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 68 SDtfs, 69 SDslu, 1 SDs, 0 SdLazy, 7 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [UNKNOWN] : All requirements are consistent All requirements are consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr49ASSERT_VIOLATIONCONSISTENCYforallrequirements CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID014, ID009 are rt-consistent Requirements ID014, ID009 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID014_ID009 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID002, ID014 are rt-consistent Requirements ID002, ID014 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID002_ID014 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID004, ID014 are rt-consistent Requirements ID004, ID014 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID004_ID014 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID014, ID005 are rt-consistent Requirements ID014, ID005 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID014_ID005 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID004 is non-vacuous Requirement ID004 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr35ASSERT_VIOLATIONVACUOUSforID004 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID002, ID008 are rt-consistent Requirements ID002, ID008 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID002_ID008 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 68 SDtfs, 68 SDslu, 1 SDs, 0 SdLazy, 7 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID014, ID011 are rt-consistent Requirements ID014, ID011 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID014_ID011 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID008, ID014 are rt-consistent Requirements ID008, ID014 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID008_ID014 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID001 is non-vacuous Requirement ID001 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr45ASSERT_VIOLATIONVACUOUSforID001 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID014, ID010 are rt-consistent Requirements ID014, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr19ASSERT_VIOLATIONRTINCONSISTENTforID014_ID010 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID010, ID012 are rt-consistent Requirements ID010, ID012 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr33ASSERT_VIOLATIONRTINCONSISTENTforID010_ID012 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID010, ID000 are rt-consistent Requirements ID010, ID000 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr32ASSERT_VIOLATIONRTINCONSISTENTforID010_ID000 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that Requirement ID005 is non-vacuous (line -1). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while XnfDer was eliminating 1 quantified variables from 4 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr40ASSERT_VIOLATIONVACUOUSforID005 CFG has 1 procedures, 103 locations, 50 error locations. TIMEOUT Result, 300.2s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 122 SDtfs, 268 SDslu, 286 SDs, 0 SdLazy, 25 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=2, 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, 2 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 16 NumberOfNonLiveVariables, 248 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/84 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID007 is non-vacuous Requirement ID007 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr46ASSERT_VIOLATIONVACUOUSforID007 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 2.4s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 123 SDtfs, 79 SDslu, 315 SDs, 0 SdLazy, 18 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=2, 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, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 400 NumberOfCodeBlocks, 400 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 13 NumberOfNonLiveVariables, 258 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/96 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID008, ID010 are rt-consistent Requirements ID008, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID008_ID010 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID013 is non-vacuous Requirement ID013 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr36ASSERT_VIOLATIONVACUOUSforID013 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID000 is non-vacuous Requirement ID000 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr47ASSERT_VIOLATIONVACUOUSforID000 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID010 is non-vacuous Requirement ID010 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr44ASSERT_VIOLATIONVACUOUSforID010 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 72 SDtfs, 26 SDslu, 70 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID014, ID001 are rt-consistent Requirements ID014, ID001 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr20ASSERT_VIOLATIONRTINCONSISTENTforID014_ID001 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID010, ID001 are rt-consistent Requirements ID010, ID001 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr30ASSERT_VIOLATIONRTINCONSISTENTforID010_ID001 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID013, ID012 are rt-consistent Requirements ID013, ID012 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID013_ID012 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 69 SDtfs, 59 SDslu, 1 SDs, 0 SdLazy, 6 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID008 is non-vacuous Requirement ID008 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr37ASSERT_VIOLATIONVACUOUSforID008 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID004, ID010 are rt-consistent Requirements ID004, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID004_ID010 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID012 is non-vacuous Requirement ID012 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr48ASSERT_VIOLATIONVACUOUSforID012 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID002, ID010 are rt-consistent Requirements ID002, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID002_ID010 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID006 is non-vacuous Requirement ID006 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr43ASSERT_VIOLATIONVACUOUSforID006 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID009, ID010 are rt-consistent Requirements ID009, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr24ASSERT_VIOLATIONRTINCONSISTENTforID009_ID010 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID004, ID003 are rt-consistent Requirements ID004, ID003 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID004_ID003 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID008, ID003 are rt-consistent Requirements ID008, ID003 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID008_ID003 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID006, ID010 are rt-consistent Requirements ID006, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr29ASSERT_VIOLATIONRTINCONSISTENTforID006_ID010 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID010, ID007 are rt-consistent Requirements ID010, ID007 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr31ASSERT_VIOLATIONRTINCONSISTENTforID010_ID007 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID011, ID003 are rt-consistent Requirements ID011, ID003 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr26ASSERT_VIOLATIONRTINCONSISTENTforID011_ID003 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...