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/hybrid1_extended.new.req -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a613b84 [2019-04-04 17:46:48,689 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-04-04 17:46:48,691 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-04-04 17:46:48,703 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-04-04 17:46:48,703 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-04-04 17:46:48,704 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-04-04 17:46:48,706 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-04-04 17:46:48,708 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-04-04 17:46:48,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-04-04 17:46:48,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-04-04 17:46:48,712 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-04-04 17:46:48,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-04-04 17:46:48,713 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-04-04 17:46:48,714 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-04-04 17:46:48,716 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-04-04 17:46:48,716 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-04-04 17:46:48,717 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-04-04 17:46:48,719 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-04-04 17:46:48,722 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-04-04 17:46:48,724 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-04-04 17:46:48,725 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-04-04 17:46:48,726 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-04-04 17:46:48,729 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-04-04 17:46:48,729 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-04-04 17:46:48,729 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-04-04 17:46:48,730 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-04-04 17:46:48,731 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-04-04 17:46:48,732 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-04-04 17:46:48,732 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-04-04 17:46:48,733 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-04-04 17:46:48,734 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-04-04 17:46:48,734 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-04-04 17:46:48,736 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-04-04 17:46:48,736 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-04-04 17:46:48,737 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-04-04 17:46:48,737 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-04-04 17:46:48,737 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-04-04 17:46:48,738 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-04-04 17:46:48,739 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-04-04 17:46:48,739 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/trunk/examples/settings/reqanalyzer/reqanalyzer-nonlin.epf [2019-04-04 17:46:48,748 INFO L110 SettingsManager]: Loading preferences was successful [2019-04-04 17:46:48,749 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-04-04 17:46:48,750 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-04-04 17:46:48,750 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2019-04-04 17:46:48,751 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-04-04 17:46:48,751 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:12000 [2019-04-04 17:46:48,751 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-04-04 17:46:48,751 INFO L133 SettingsManager]: * Trace refinement exception blacklist=UNKNOWN [2019-04-04 17:46:48,751 INFO L133 SettingsManager]: * Stop after first violation was found=false [2019-04-04 17:46:48,752 INFO L133 SettingsManager]: * Compute statistics for interpolant sequences=false [2019-04-04 17:46:48,752 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM [2019-04-04 17:46:48,752 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-04-04 17:46:48,752 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:48,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-04-04 17:46:48,798 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-04-04 17:46:48,801 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-04-04 17:46:48,803 INFO L271 PluginConnector]: Initializing ReqParser... [2019-04-04 17:46:48,804 INFO L276 PluginConnector]: ReqParser initialized [2019-04-04 17:46:48,805 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/re2019-exp/hybrid1_extended.new.req [2019-04-04 17:46:48,805 INFO L94 ReqParser]: Parsing file /storage/repos/re2019-exp/hybrid1_extended.new.req [2019-04-04 17:46:48,854 INFO L134 ReqParser]: 23 requirements (12 non-initialization) in total [2019-04-04 17:46:48,859 INFO L134 ReqParser]: 23 requirements (12 non-initialization) after unification [2019-04-04 17:46:48,865 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-04-04 17:46:48,867 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-04-04 17:46:48,868 INFO L113 PluginConnector]: ------------------------PEA to Boogie---------------------------- [2019-04-04 17:46:48,868 INFO L271 PluginConnector]: Initializing PEA to Boogie... [2019-04-04 17:46:48,869 INFO L276 PluginConnector]: PEA to Boogie initialized [2019-04-04 17:46:48,870 INFO L185 PluginConnector]: Executing the observer PEAtoBoogieObserver from plugin PEA to Boogie for "de.uni_freiburg.informatik.ultimate.reqparser OTHER 04.04 05:46:48" (1/1) ... [2019-04-04 17:46:48,880 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:48,892 INFO L59 ReqToPEA]: Transforming 12 requirements to PEAs [2019-04-04 17:46:48,928 INFO L87 ReqToPEA]: Following types of requirements were processed [2019-04-04 17:46:48,928 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.MinDurationPattern : 2 [2019-04-04 17:46:48,928 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.BndResponsePatternUT : 4 [2019-04-04 17:46:48,929 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.BndInvariancePattern : 3 [2019-04-04 17:46:48,929 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.MaxDurationPattern : 3 [2019-04-04 17:46:48,929 INFO L92 ReqToPEA]: Finished transforming 12 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:49,281 INFO L154 cyConditionGenerator]: Finished generating primed state invariant of size 1 [2019-04-04 17:46:49,312 INFO L769 Req2BoogieTranslator]: 0 of 12 requirements are invariant [2019-04-04 17:46:49,313 INFO L786 Req2BoogieTranslator]: Computing rt-inconsistency assertions for 66 subsets [2019-04-04 17:46:49,864 INFO L284 cyConditionGenerator]: 66 checks, 48 trivial consistent, 18 non-trivial [2019-04-04 17:46:49,865 INFO L290 cyConditionGenerator]: Of 693 formulas, 0 were quantified, 693 were plain. Needed 268 quantifier elimination runs, 0 quantified solver queries. [2019-04-04 17:46:49,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:49 Unit [2019-04-04 17:46:49,881 INFO L132 PluginConnector]: ------------------------ END PEA to Boogie---------------------------- [2019-04-04 17:46:49,885 INFO L113 PluginConnector]: ------------------------Boogie Printer---------------------------- [2019-04-04 17:46:49,885 INFO L271 PluginConnector]: Initializing Boogie Printer... [2019-04-04 17:46:49,885 INFO L276 PluginConnector]: Boogie Printer initialized [2019-04-04 17:46:49,887 INFO L185 PluginConnector]: Executing the observer BoogiePrinterObserver from plugin Boogie Printer for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:49" (1/1) ... [2019-04-04 17:46:49,887 INFO L116 oogiePrinterObserver]: File already exists and will be overwritten: /tmp/boogiePrinter.bpl [2019-04-04 17:46:49,888 INFO L120 oogiePrinterObserver]: Writing to file /tmp/boogiePrinter.bpl [2019-04-04 17:46:49,914 INFO L132 PluginConnector]: ------------------------ END Boogie Printer---------------------------- [2019-04-04 17:46:49,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-04-04 17:46:49,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-04-04 17:46:49,915 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-04-04 17:46:49,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:49" (1/1) ... [2019-04-04 17:46:49,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:49" (1/1) ... [2019-04-04 17:46:49,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:49" (1/1) ... [2019-04-04 17:46:49,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:49" (1/1) ... [2019-04-04 17:46:49,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:49" (1/1) ... [2019-04-04 17:46:50,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:49" (1/1) ... [2019-04-04 17:46:50,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:49" (1/1) ... [2019-04-04 17:46:50,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-04-04 17:46:50,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-04-04 17:46:50,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-04-04 17:46:50,039 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-04-04 17:46:50,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:49" (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:50,062 INFO L124 BoogieDeclarations]: Specification and implementation of procedure myProcedure given in one single declaration [2019-04-04 17:46:50,062 INFO L130 BoogieDeclarations]: Found specification of procedure myProcedure [2019-04-04 17:46:50,063 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:53,912 INFO L278 CfgBuilder]: Using library mode [2019-04-04 17:46:53,912 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-04-04 17:46:53,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 05:46:53 BoogieIcfgContainer [2019-04-04 17:46:53,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-04-04 17:46:53,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-04-04 17:46:53,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-04-04 17:46:53,918 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-04-04 17:46:53,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.reqparser OTHER 04.04 05:46:48" (1/3) ... [2019-04-04 17:46:53,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f43a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 04.04 05:46:53, skipping insertion in model container [2019-04-04 17:46:53,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:46:49" (2/3) ... [2019-04-04 17:46:53,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f43a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 05:46:53, skipping insertion in model container [2019-04-04 17:46:53,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 05:46:53" (3/3) ... [2019-04-04 17:46:53,922 INFO L112 eAbstractionObserver]: Analyzing ICFG [2019-04-04 17:46:53,931 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-04-04 17:46:53,936 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-04-04 17:46:53,954 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:53,978 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:53,978 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:53,978 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:53,978 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:53,979 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:53,979 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:53,979 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:53,980 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr21ASSERT_VIOLATIONVACUOUSforID001======== [2019-04-04 17:46:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:54,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-04-04 17:46:54,005 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:54,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] [2019-04-04 17:46:54,007 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr21ASSERT_VIOLATIONVACUOUSforID001]=== [2019-04-04 17:46:54,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:54,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2113833959, now seen corresponding path program 1 times [2019-04-04 17:46:54,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:54,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:54,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:54,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:54,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:54,315 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:54,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:54,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:54,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 17:46:54,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 17:46:54,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:46:54,341 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-04-04 17:46:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:54,461 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-04-04 17:46:54,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 17:46:54,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-04-04 17:46:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:54,478 INFO L225 Difference]: With dead ends: 96 [2019-04-04 17:46:54,478 INFO L226 Difference]: Without dead ends: 66 [2019-04-04 17:46:54,480 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:46:54,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-04-04 17:46:54,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2019-04-04 17:46:54,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-04-04 17:46:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-04-04 17:46:54,524 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 24 [2019-04-04 17:46:54,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:54,526 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-04-04 17:46:54,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 17:46:54,527 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-04-04 17:46:54,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-04-04 17:46:54,531 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:54,531 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:46:54,532 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr21ASSERT_VIOLATIONVACUOUSforID001]=== [2019-04-04 17:46:54,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:54,533 INFO L82 PathProgramCache]: Analyzing trace with hash 926939930, now seen corresponding path program 1 times [2019-04-04 17:46:54,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:54,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:54,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:54,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:54,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:46:54,668 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:46:54,681 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr21ASSERT_VIOLATIONVACUOUSforID001 was UNSAFE (1/31) [2019-04-04 17:46:54,683 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:54,684 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:54,684 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:54,684 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:54,684 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:54,684 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:54,684 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:54,684 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:54,685 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr27ASSERT_VIOLATIONVACUOUSforID005======== [2019-04-04 17:46:54,687 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:54,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-04-04 17:46:54,689 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:54,689 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:46:54,689 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr27ASSERT_VIOLATIONVACUOUSforID005]=== [2019-04-04 17:46:54,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:54,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1067048525, now seen corresponding path program 1 times [2019-04-04 17:46:54,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:54,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:54,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:54,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:54,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:46:54,744 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:46:54,745 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr27ASSERT_VIOLATIONVACUOUSforID005 was UNSAFE (2/31) [2019-04-04 17:46:54,746 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:54,746 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:54,746 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:54,746 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:54,746 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:54,747 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:54,752 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:54,752 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:54,752 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID011_ID006======== [2019-04-04 17:46:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:54,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-04-04 17:46:54,757 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:54,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:46:54,758 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID011_ID006]=== [2019-04-04 17:46:54,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:54,758 INFO L82 PathProgramCache]: Analyzing trace with hash -2073485063, now seen corresponding path program 1 times [2019-04-04 17:46:54,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:54,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:54,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:54,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:54,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:54,807 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:54,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:54,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:54,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:46:54,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:46:54,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:54,812 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 17:46:54,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:54,816 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 17:46:54,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:46:54,816 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-04-04 17:46:54,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:54,816 INFO L225 Difference]: With dead ends: 49 [2019-04-04 17:46:54,817 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:54,817 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:54,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:54,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:54,818 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-04-04 17:46:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:54,818 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:54,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:46:54,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:54,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:54,819 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID011_ID006 was SAFE (3/31) [2019-04-04 17:46:54,820 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:54,821 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:54,821 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:54,821 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:54,821 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:54,821 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:54,821 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:54,821 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:54,822 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID000_ID002======== [2019-04-04 17:46:54,824 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:54,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-04-04 17:46:54,825 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:54,825 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:46:54,825 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID000_ID002]=== [2019-04-04 17:46:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:54,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1090844594, now seen corresponding path program 1 times [2019-04-04 17:46:54,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:54,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:54,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:54,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:54,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:54,868 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:54,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:54,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:54,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:46:54,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:46:54,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:54,870 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 17:46:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:54,874 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 17:46:54,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:46:54,875 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-04-04 17:46:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:54,875 INFO L225 Difference]: With dead ends: 49 [2019-04-04 17:46:54,875 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:54,876 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:54,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:54,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-04-04 17:46:54,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:54,877 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:54,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:46:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:54,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:54,878 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID000_ID002 was SAFE (4/31) [2019-04-04 17:46:54,879 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:54,879 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:54,879 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:54,879 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:54,879 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:54,879 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:54,879 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:54,879 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:54,879 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr23ASSERT_VIOLATIONVACUOUSforID000======== [2019-04-04 17:46:54,881 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:54,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-04-04 17:46:54,882 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:54,883 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:54,883 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr23ASSERT_VIOLATIONVACUOUSforID000]=== [2019-04-04 17:46:54,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:54,883 INFO L82 PathProgramCache]: Analyzing trace with hash -125087223, now seen corresponding path program 1 times [2019-04-04 17:46:54,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:54,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:54,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:54,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:54,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:46:54,898 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:46:54,898 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr23ASSERT_VIOLATIONVACUOUSforID000 was UNSAFE (5/31) [2019-04-04 17:46:54,899 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:54,900 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:54,900 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:54,900 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:54,900 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:54,900 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:54,900 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:54,900 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:54,901 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID009_ID010======== [2019-04-04 17:46:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:54,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-04-04 17:46:54,903 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:54,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] [2019-04-04 17:46:54,903 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID009_ID010]=== [2019-04-04 17:46:54,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:54,904 INFO L82 PathProgramCache]: Analyzing trace with hash -543555677, now seen corresponding path program 1 times [2019-04-04 17:46:54,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:54,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:54,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:54,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:54,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:55,149 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:55,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:55,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:46:55,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:46:55,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:46:55,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:46:55,150 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 4 states. [2019-04-04 17:46:55,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:55,282 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-04-04 17:46:55,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:46:55,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-04-04 17:46:55,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:55,284 INFO L225 Difference]: With dead ends: 96 [2019-04-04 17:46:55,284 INFO L226 Difference]: Without dead ends: 66 [2019-04-04 17:46:55,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:46:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-04-04 17:46:55,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2019-04-04 17:46:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-04-04 17:46:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-04-04 17:46:55,291 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 20 [2019-04-04 17:46:55,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:55,291 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-04-04 17:46:55,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:46:55,292 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-04-04 17:46:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-04-04 17:46:55,295 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:55,295 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-04-04 17:46:55,295 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID009_ID010]=== [2019-04-04 17:46:55,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:55,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1518403670, now seen corresponding path program 1 times [2019-04-04 17:46:55,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:55,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:55,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:55,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-04 17:46:55,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:55,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:46:55,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 17:46:55,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 17:46:55,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:46:55,464 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 3 states. [2019-04-04 17:46:55,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:55,481 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-04-04 17:46:55,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 17:46:55,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-04-04 17:46:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:55,485 INFO L225 Difference]: With dead ends: 52 [2019-04-04 17:46:55,485 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:55,486 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:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:55,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:55,487 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2019-04-04 17:46:55,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:55,487 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:55,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 17:46:55,487 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:55,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:55,488 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID009_ID010 was SAFE (6/31) [2019-04-04 17:46:55,489 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:55,489 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:55,489 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:55,489 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:55,489 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:55,489 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:55,489 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:55,489 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:55,489 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID011_ID001======== [2019-04-04 17:46:55,490 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-04-04 17:46:55,491 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:55,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:46:55,491 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID011_ID001]=== [2019-04-04 17:46:55,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:55,492 INFO L82 PathProgramCache]: Analyzing trace with hash -898170616, now seen corresponding path program 1 times [2019-04-04 17:46:55,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:55,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:55,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:55,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:55,509 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:55,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:55,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:55,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:46:55,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:46:55,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:55,511 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 17:46:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:55,514 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 17:46:55,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:46:55,514 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-04-04 17:46:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:55,514 INFO L225 Difference]: With dead ends: 49 [2019-04-04 17:46:55,515 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:55,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:46:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:55,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:55,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:55,516 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-04-04 17:46:55,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:55,516 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:55,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:46:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:55,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:55,518 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID011_ID001 was SAFE (7/31) [2019-04-04 17:46:55,518 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:55,519 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:55,519 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:55,519 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:55,519 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:55,519 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:55,520 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:55,520 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:55,520 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID008_ID011======== [2019-04-04 17:46:55,521 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-04-04 17:46:55,522 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:55,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-04-04 17:46:55,522 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID008_ID011]=== [2019-04-04 17:46:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:55,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2003211445, now seen corresponding path program 1 times [2019-04-04 17:46:55,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:55,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:55,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:55,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:55,540 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:55,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:55,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:55,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:46:55,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:46:55,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:55,542 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 17:46:55,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:55,544 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 17:46:55,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:46:55,545 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-04-04 17:46:55,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:55,545 INFO L225 Difference]: With dead ends: 49 [2019-04-04 17:46:55,545 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:55,546 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:55,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:55,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:55,571 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-04-04 17:46:55,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:55,571 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:55,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:46:55,572 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:55,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:55,572 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID008_ID011 was SAFE (8/31) [2019-04-04 17:46:55,573 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:55,574 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:55,574 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:55,574 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:55,574 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:55,574 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:55,574 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:55,574 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:55,574 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr19ASSERT_VIOLATIONVACUOUSforID008======== [2019-04-04 17:46:55,579 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:55,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-04-04 17:46:55,582 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:55,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] [2019-04-04 17:46:55,583 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr19ASSERT_VIOLATIONVACUOUSforID008]=== [2019-04-04 17:46:55,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:55,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1629013445, now seen corresponding path program 1 times [2019-04-04 17:46:55,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:55,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:55,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:55,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:55,706 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:55,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:55,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:55,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 17:46:55,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 17:46:55,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:46:55,708 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-04-04 17:46:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:55,740 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-04-04 17:46:55,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 17:46:55,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-04-04 17:46:55,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:55,744 INFO L225 Difference]: With dead ends: 96 [2019-04-04 17:46:55,744 INFO L226 Difference]: Without dead ends: 66 [2019-04-04 17:46:55,745 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:46:55,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-04-04 17:46:55,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2019-04-04 17:46:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-04-04 17:46:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-04-04 17:46:55,753 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 22 [2019-04-04 17:46:55,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:55,753 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-04-04 17:46:55,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 17:46:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-04-04 17:46:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-04-04 17:46:55,754 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:55,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:46:55,755 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr19ASSERT_VIOLATIONVACUOUSforID008]=== [2019-04-04 17:46:55,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:55,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1102944840, now seen corresponding path program 1 times [2019-04-04 17:46:55,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:55,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:55,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:55,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:46:55,784 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:46:55,785 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr19ASSERT_VIOLATIONVACUOUSforID008 was UNSAFE (9/31) [2019-04-04 17:46:55,786 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:55,786 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:55,787 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:55,787 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:55,787 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:55,787 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:55,787 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:55,787 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:55,787 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr22ASSERT_VIOLATIONVACUOUSforID006======== [2019-04-04 17:46:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-04-04 17:46:55,789 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:55,789 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:46:55,789 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr22ASSERT_VIOLATIONVACUOUSforID006]=== [2019-04-04 17:46:55,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:55,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1104343576, now seen corresponding path program 1 times [2019-04-04 17:46:55,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:55,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:55,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:55,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:46:55,800 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:46:55,800 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr22ASSERT_VIOLATIONVACUOUSforID006 was UNSAFE (10/31) [2019-04-04 17:46:55,801 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:55,801 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:55,801 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:55,802 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:55,802 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:55,802 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:55,802 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:55,802 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:55,802 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID008_ID000======== [2019-04-04 17:46:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-04-04 17:46:55,803 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:55,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:46:55,804 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID008_ID000]=== [2019-04-04 17:46:55,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:55,804 INFO L82 PathProgramCache]: Analyzing trace with hash 940858071, now seen corresponding path program 1 times [2019-04-04 17:46:55,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:55,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:55,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:55,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:55,821 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:55,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:55,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:55,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:46:55,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:46:55,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:55,823 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 17:46:55,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:55,824 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 17:46:55,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:46:55,825 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-04-04 17:46:55,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:55,826 INFO L225 Difference]: With dead ends: 49 [2019-04-04 17:46:55,826 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:55,826 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:55,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:55,827 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-04-04 17:46:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:55,827 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:55,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:46:55,828 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:55,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:55,828 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID008_ID000 was SAFE (11/31) [2019-04-04 17:46:55,829 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:55,830 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:55,830 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:55,830 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:55,830 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:55,830 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:55,830 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:55,831 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:55,831 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID011_ID005======== [2019-04-04 17:46:55,832 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:55,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-04-04 17:46:55,839 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:55,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:46:55,840 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID011_ID005]=== [2019-04-04 17:46:55,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:55,840 INFO L82 PathProgramCache]: Analyzing trace with hash 669907822, now seen corresponding path program 1 times [2019-04-04 17:46:55,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:55,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:55,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:55,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:55,860 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:55,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:55,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:55,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:46:55,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:46:55,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:55,862 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 17:46:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:55,863 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 17:46:55,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:46:55,863 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-04-04 17:46:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:55,864 INFO L225 Difference]: With dead ends: 49 [2019-04-04 17:46:55,864 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:55,864 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:55,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:55,865 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-04-04 17:46:55,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:55,865 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:55,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:46:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:55,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:55,866 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID011_ID005 was SAFE (12/31) [2019-04-04 17:46:55,867 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:55,867 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:55,867 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:55,867 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:55,867 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:55,867 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:55,867 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:55,868 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:55,868 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID011_ID009======== [2019-04-04 17:46:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-04-04 17:46:55,869 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:55,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:46:55,870 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID011_ID009]=== [2019-04-04 17:46:55,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:55,870 INFO L82 PathProgramCache]: Analyzing trace with hash -973603508, now seen corresponding path program 1 times [2019-04-04 17:46:55,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:55,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:55,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:55,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:55,891 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:55,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:55,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:55,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:46:55,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:46:55,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:55,893 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 17:46:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:55,894 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 17:46:55,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:46:55,894 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-04-04 17:46:55,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:55,894 INFO L225 Difference]: With dead ends: 49 [2019-04-04 17:46:55,895 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:55,895 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:55,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:55,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:55,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:55,896 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-04-04 17:46:55,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:55,896 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:55,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:46:55,896 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:55,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:55,897 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID011_ID009 was SAFE (13/31) [2019-04-04 17:46:55,898 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:55,898 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:55,898 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:55,898 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:55,898 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:55,898 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:55,899 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:55,899 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:55,899 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr24ASSERT_VIOLATIONVACUOUSforID004======== [2019-04-04 17:46:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:55,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-04-04 17:46:55,905 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:55,905 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:46:55,909 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr24ASSERT_VIOLATIONVACUOUSforID004]=== [2019-04-04 17:46:55,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:55,909 INFO L82 PathProgramCache]: Analyzing trace with hash 417263674, now seen corresponding path program 1 times [2019-04-04 17:46:55,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:55,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:55,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:55,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:46:55,928 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:46:55,929 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr24ASSERT_VIOLATIONVACUOUSforID004 was UNSAFE (14/31) [2019-04-04 17:46:55,933 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:55,933 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:55,933 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:55,933 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:55,934 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:55,934 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:55,934 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:55,934 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:55,934 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID001_ID000======== [2019-04-04 17:46:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-04-04 17:46:55,935 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:55,935 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:46:55,936 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID001_ID000]=== [2019-04-04 17:46:55,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:55,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1488832127, now seen corresponding path program 1 times [2019-04-04 17:46:55,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:55,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:55,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:55,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:55,955 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:55,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:55,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:55,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:46:55,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:46:55,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:55,956 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 17:46:55,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:55,958 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 17:46:55,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:46:55,958 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-04-04 17:46:55,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:55,958 INFO L225 Difference]: With dead ends: 49 [2019-04-04 17:46:55,959 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:55,959 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:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:55,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:56,074 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-04-04 17:46:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:56,075 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:56,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:46:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:56,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:56,076 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID001_ID000 was SAFE (15/31) [2019-04-04 17:46:56,076 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:56,077 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:56,077 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:56,077 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:56,077 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:56,077 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:56,077 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:56,077 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:56,078 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr28ASSERT_VIOLATIONVACUOUSforID010======== [2019-04-04 17:46:56,084 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-04-04 17:46:56,084 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:56,084 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:46:56,085 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr28ASSERT_VIOLATIONVACUOUSforID010]=== [2019-04-04 17:46:56,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:56,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1281233794, now seen corresponding path program 1 times [2019-04-04 17:46:56,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:56,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:56,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:56,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:46:56,095 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:46:56,096 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr28ASSERT_VIOLATIONVACUOUSforID010 was UNSAFE (16/31) [2019-04-04 17:46:56,097 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:56,098 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:56,098 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:56,098 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:56,098 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:56,098 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:56,098 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:56,098 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:56,099 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr20ASSERT_VIOLATIONVACUOUSforID011======== [2019-04-04 17:46:56,099 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:56,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-04-04 17:46:56,101 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:56,101 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:46:56,101 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr20ASSERT_VIOLATIONVACUOUSforID011]=== [2019-04-04 17:46:56,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:56,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1040190474, now seen corresponding path program 1 times [2019-04-04 17:46:56,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:56,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:56,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:56,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:56,230 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,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:56,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:56,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 17:46:56,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 17:46:56,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:46:56,232 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-04-04 17:46:56,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:56,334 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-04-04 17:46:56,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 17:46:56,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-04-04 17:46:56,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:56,336 INFO L225 Difference]: With dead ends: 95 [2019-04-04 17:46:56,336 INFO L226 Difference]: Without dead ends: 66 [2019-04-04 17:46:56,336 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:46:56,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-04-04 17:46:56,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2019-04-04 17:46:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-04-04 17:46:56,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-04-04 17:46:56,348 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 23 [2019-04-04 17:46:56,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:56,348 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-04-04 17:46:56,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 17:46:56,348 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-04-04 17:46:56,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-04-04 17:46:56,349 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:56,349 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:46:56,349 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr20ASSERT_VIOLATIONVACUOUSforID011]=== [2019-04-04 17:46:56,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:56,350 INFO L82 PathProgramCache]: Analyzing trace with hash 168448611, now seen corresponding path program 1 times [2019-04-04 17:46:56,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:56,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:56,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:56,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:46:56,387 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:46:56,389 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr20ASSERT_VIOLATIONVACUOUSforID011 was UNSAFE (17/31) [2019-04-04 17:46:56,390 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:56,390 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:56,390 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:56,390 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:56,391 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:56,391 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:56,391 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:56,391 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:56,391 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr25ASSERT_VIOLATIONVACUOUSforID009======== [2019-04-04 17:46:56,392 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:56,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-04-04 17:46:56,393 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:56,393 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:46:56,393 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr25ASSERT_VIOLATIONVACUOUSforID009]=== [2019-04-04 17:46:56,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:56,394 INFO L82 PathProgramCache]: Analyzing trace with hash 50272299, now seen corresponding path program 1 times [2019-04-04 17:46:56,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:56,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:56,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:56,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:46:56,404 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:46:56,405 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr25ASSERT_VIOLATIONVACUOUSforID009 was UNSAFE (18/31) [2019-04-04 17:46:56,406 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:56,407 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:56,407 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:56,407 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:56,407 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:56,407 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:56,407 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:56,407 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:56,408 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID007_ID011======== [2019-04-04 17:46:56,408 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:56,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-04-04 17:46:56,409 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:56,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-04-04 17:46:56,409 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID007_ID011]=== [2019-04-04 17:46:56,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:56,410 INFO L82 PathProgramCache]: Analyzing trace with hash 2084499, now seen corresponding path program 1 times [2019-04-04 17:46:56,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:56,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:56,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:56,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:56,430 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,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:56,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:56,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:46:56,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:46:56,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:56,434 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 17:46:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:56,434 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 17:46:56,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:46:56,435 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-04-04 17:46:56,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:56,436 INFO L225 Difference]: With dead ends: 49 [2019-04-04 17:46:56,436 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:56,436 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,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:56,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:56,437 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-04-04 17:46:56,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:56,437 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:56,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:46:56,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:56,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:56,438 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID007_ID011 was SAFE (19/31) [2019-04-04 17:46:56,441 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:56,441 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:56,441 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:56,441 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:56,442 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:56,442 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:56,442 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:56,442 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:56,442 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID011_ID000======== [2019-04-04 17:46:56,443 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-04-04 17:46:56,443 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:56,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:46:56,444 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID011_ID000]=== [2019-04-04 17:46:56,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:56,444 INFO L82 PathProgramCache]: Analyzing trace with hash 146472746, now seen corresponding path program 1 times [2019-04-04 17:46:56,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:56,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:56,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:56,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:56,461 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,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:56,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:56,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:46:56,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:46:56,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:56,463 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 17:46:56,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:56,463 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 17:46:56,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:46:56,464 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-04-04 17:46:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:56,464 INFO L225 Difference]: With dead ends: 49 [2019-04-04 17:46:56,464 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:56,464 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,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:56,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:56,467 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-04-04 17:46:56,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:56,468 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:56,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:46:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:56,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:56,469 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID011_ID000 was SAFE (20/31) [2019-04-04 17:46:56,469 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:56,469 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:56,470 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:56,471 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:56,471 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:56,471 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:56,471 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:56,471 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:56,472 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr29ASSERT_VIOLATIONVACUOUSforID003======== [2019-04-04 17:46:56,472 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:56,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-04-04 17:46:56,473 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:56,473 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:46:56,473 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr29ASSERT_VIOLATIONVACUOUSforID003]=== [2019-04-04 17:46:56,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:56,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1063541649, now seen corresponding path program 1 times [2019-04-04 17:46:56,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:56,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:56,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:56,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:46:56,483 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:46:56,493 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr29ASSERT_VIOLATIONVACUOUSforID003 was UNSAFE (21/31) [2019-04-04 17:46:56,494 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:56,494 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:56,494 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:56,494 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:56,494 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:56,494 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:56,494 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:56,495 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:56,495 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID011_ID002======== [2019-04-04 17:46:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:56,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-04-04 17:46:56,498 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:56,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:46:56,499 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID011_ID002]=== [2019-04-04 17:46:56,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:56,499 INFO L82 PathProgramCache]: Analyzing trace with hash -116937411, now seen corresponding path program 1 times [2019-04-04 17:46:56,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:56,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:56,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:56,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:56,520 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,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:56,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:56,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:46:56,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:46:56,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:56,521 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 17:46:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:56,522 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 17:46:56,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:46:56,522 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-04-04 17:46:56,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:56,522 INFO L225 Difference]: With dead ends: 49 [2019-04-04 17:46:56,523 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:56,523 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,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:56,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:56,524 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2019-04-04 17:46:56,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:56,524 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:56,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:46:56,524 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:56,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:56,525 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID011_ID002 was SAFE (22/31) [2019-04-04 17:46:56,525 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:56,526 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:56,526 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:56,526 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:56,526 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:56,526 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:56,526 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:56,526 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:56,526 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID007_ID001======== [2019-04-04 17:46:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-04-04 17:46:56,527 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:56,528 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-04-04 17:46:56,528 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID007_ID001]=== [2019-04-04 17:46:56,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:56,528 INFO L82 PathProgramCache]: Analyzing trace with hash 64619716, now seen corresponding path program 1 times [2019-04-04 17:46:56,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:56,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:56,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:56,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:56,542 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,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:56,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:56,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:46:56,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:46:56,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:56,543 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 17:46:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:56,544 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 17:46:56,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:46:56,544 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-04-04 17:46:56,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:56,545 INFO L225 Difference]: With dead ends: 49 [2019-04-04 17:46:56,545 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:56,545 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,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:56,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:56,546 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-04-04 17:46:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:56,546 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:56,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:46:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:56,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:56,547 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID007_ID001 was SAFE (23/31) [2019-04-04 17:46:56,548 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:56,548 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:56,548 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:56,548 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:56,548 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:56,548 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:56,548 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:56,548 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:56,549 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID007_ID008======== [2019-04-04 17:46:56,549 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:56,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-04-04 17:46:56,550 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:56,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-04-04 17:46:56,550 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID007_ID008]=== [2019-04-04 17:46:56,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:56,550 INFO L82 PathProgramCache]: Analyzing trace with hash 67234, now seen corresponding path program 1 times [2019-04-04 17:46:56,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:56,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:56,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:56,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:56,565 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,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:56,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:56,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:46:56,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:46:56,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:56,566 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 17:46:56,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:56,567 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 17:46:56,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:46:56,567 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 3 [2019-04-04 17:46:56,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:56,568 INFO L225 Difference]: With dead ends: 49 [2019-04-04 17:46:56,568 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:56,568 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,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:56,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:56,569 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 [2019-04-04 17:46:56,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:56,569 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:56,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:46:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:56,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:56,570 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID007_ID008 was SAFE (24/31) [2019-04-04 17:46:56,571 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:56,571 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:56,571 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:56,571 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:56,571 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:56,571 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:56,572 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:56,572 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:56,572 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr30ASSERT_VIOLATIONCONSISTENCYforallrequirements======== [2019-04-04 17:46:56,573 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-04-04 17:46:56,573 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:56,573 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:46:56,574 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr30ASSERT_VIOLATIONCONSISTENCYforallrequirements]=== [2019-04-04 17:46:56,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:56,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1389947552, now seen corresponding path program 1 times [2019-04-04 17:46:56,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:56,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:56,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:56,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:46:56,583 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:46:56,584 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr30ASSERT_VIOLATIONCONSISTENCYforallrequirements was UNSAFE (25/31) [2019-04-04 17:46:56,585 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:56,585 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:56,585 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:56,585 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:56,585 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:56,585 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:56,585 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:56,586 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:56,586 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr26ASSERT_VIOLATIONVACUOUSforID002======== [2019-04-04 17:46:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:56,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-04-04 17:46:56,587 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:56,587 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:46:56,587 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr26ASSERT_VIOLATIONVACUOUSforID002]=== [2019-04-04 17:46:56,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:56,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1558441564, now seen corresponding path program 1 times [2019-04-04 17:46:56,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:56,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:56,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:56,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:46:56,596 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:46:56,597 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr26ASSERT_VIOLATIONVACUOUSforID002 was UNSAFE (26/31) [2019-04-04 17:46:56,597 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:56,598 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:56,598 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:56,598 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:56,598 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:56,598 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:56,598 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:56,598 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:56,598 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID008_ID001======== [2019-04-04 17:46:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-04-04 17:46:56,599 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:56,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:46:56,600 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID008_ID001]=== [2019-04-04 17:46:56,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:56,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1970012902, now seen corresponding path program 1 times [2019-04-04 17:46:56,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:56,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:56,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:56,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:56,614 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,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:56,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:56,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:46:56,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:46:56,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:56,616 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 17:46:56,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:56,616 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 17:46:56,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:46:56,617 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2019-04-04 17:46:56,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:56,617 INFO L225 Difference]: With dead ends: 49 [2019-04-04 17:46:56,617 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:56,617 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,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:56,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:56,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:56,618 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-04-04 17:46:56,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:56,618 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:56,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:46:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:56,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:56,619 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID008_ID001 was SAFE (27/31) [2019-04-04 17:46:56,620 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:56,620 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:56,620 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:56,620 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:56,620 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:56,621 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:56,621 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:56,621 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:56,621 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010======== [2019-04-04 17:46:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:56,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-04-04 17:46:56,622 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:56,622 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:46:56,622 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010]=== [2019-04-04 17:46:56,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:56,623 INFO L82 PathProgramCache]: Analyzing trace with hash -707693729, now seen corresponding path program 1 times [2019-04-04 17:46:56,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:56,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:56,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:56,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:56,888 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,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:56,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:46:56,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:46:56,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:46:56,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:46:56,889 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 4 states. [2019-04-04 17:46:57,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:57,032 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-04-04 17:46:57,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 17:46:57,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-04-04 17:46:57,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:57,033 INFO L225 Difference]: With dead ends: 95 [2019-04-04 17:46:57,033 INFO L226 Difference]: Without dead ends: 66 [2019-04-04 17:46:57,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:46:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-04-04 17:46:57,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 49. [2019-04-04 17:46:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-04-04 17:46:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-04-04 17:46:57,038 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 16 [2019-04-04 17:46:57,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:57,038 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-04-04 17:46:57,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:46:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-04-04 17:46:57,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-04-04 17:46:57,039 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:57,039 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-04-04 17:46:57,039 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010]=== [2019-04-04 17:46:57,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:57,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1159543406, now seen corresponding path program 1 times [2019-04-04 17:46:57,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:57,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:57,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:57,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:57,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-04 17:46:57,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:57,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:46:57,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 17:46:57,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 17:46:57,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:46:57,153 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 3 states. [2019-04-04 17:46:57,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:57,206 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-04-04 17:46:57,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 17:46:57,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-04-04 17:46:57,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:57,208 INFO L225 Difference]: With dead ends: 48 [2019-04-04 17:46:57,208 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:57,209 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,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:57,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:57,210 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2019-04-04 17:46:57,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:57,210 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:57,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 17:46:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:57,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:57,211 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010 was SAFE (28/31) [2019-04-04 17:46:57,212 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:57,212 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:57,212 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:57,212 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:57,212 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:57,213 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:57,213 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:57,213 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:57,213 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr18ASSERT_VIOLATIONVACUOUSforID007======== [2019-04-04 17:46:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:57,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-04-04 17:46:57,215 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:57,215 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:46:57,215 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr18ASSERT_VIOLATIONVACUOUSforID007]=== [2019-04-04 17:46:57,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:57,215 INFO L82 PathProgramCache]: Analyzing trace with hash 329643476, now seen corresponding path program 1 times [2019-04-04 17:46:57,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:57,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:57,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:57,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:57,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:46:57,225 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:46:57,226 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr18ASSERT_VIOLATIONVACUOUSforID007 was UNSAFE (29/31) [2019-04-04 17:46:57,226 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:57,227 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:57,227 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:57,227 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:57,227 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:57,227 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:57,227 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:57,227 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:57,227 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID011_ID003======== [2019-04-04 17:46:57,228 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-04-04 17:46:57,229 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:57,229 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:46:57,229 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID011_ID003]=== [2019-04-04 17:46:57,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:57,229 INFO L82 PathProgramCache]: Analyzing trace with hash -463668848, now seen corresponding path program 1 times [2019-04-04 17:46:57,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:57,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:57,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:57,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:57,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:57,244 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,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:57,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:57,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:46:57,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:46:57,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:57,246 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 17:46:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:57,247 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 17:46:57,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:46:57,247 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-04-04 17:46:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:57,247 INFO L225 Difference]: With dead ends: 49 [2019-04-04 17:46:57,247 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:57,248 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,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:57,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:57,249 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-04-04 17:46:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:57,249 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:57,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:46:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:57,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:57,250 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID011_ID003 was SAFE (30/31) [2019-04-04 17:46:57,251 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:46:57,251 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:46:57,251 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:46:57,251 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:46:57,251 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:46:57,251 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:46:57,252 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:46:57,252 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:46:57,252 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID011_ID004======== [2019-04-04 17:46:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 17:46:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-04-04 17:46:57,253 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:46:57,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:46:57,254 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID011_ID004]=== [2019-04-04 17:46:57,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:46:57,254 INFO L82 PathProgramCache]: Analyzing trace with hash 245688091, now seen corresponding path program 1 times [2019-04-04 17:46:57,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:46:57,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:46:57,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:57,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:46:57,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:46:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:46:57,270 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,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:46:57,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:46:57,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:46:57,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:46:57,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:46:57,272 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 17:46:57,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:46:57,273 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 17:46:57,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:46:57,274 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-04-04 17:46:57,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:46:57,274 INFO L225 Difference]: With dead ends: 49 [2019-04-04 17:46:57,274 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:46:57,275 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,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:46:57,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:46:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:46:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:46:57,276 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-04-04 17:46:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:46:57,276 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:46:57,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:46:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:46:57,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:46:57,277 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID011_ID004 was SAFE (31/31) [2019-04-04 17:46:57,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.04 05:46:57 BoogieIcfgContainer [2019-04-04 17:46:57,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-04-04 17:46:57,278 INFO L168 Benchmark]: Toolchain (without parser) took 8412.09 ms. Allocated memory was 135.3 MB in the beginning and 313.0 MB in the end (delta: 177.7 MB). Free memory was 110.6 MB in the beginning and 172.4 MB in the end (delta: -61.8 MB). Peak memory consumption was 115.9 MB. Max. memory is 7.1 GB. [2019-04-04 17:46:57,281 INFO L168 Benchmark]: ReqParser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 112.9 MB in the beginning and 112.7 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:46:57,282 INFO L168 Benchmark]: PEA to Boogie took 1016.26 ms. Allocated memory was 135.3 MB in the beginning and 169.3 MB in the end (delta: 34.1 MB). Free memory was 110.6 MB in the beginning and 128.5 MB in the end (delta: -17.9 MB). Peak memory consumption was 53.5 MB. Max. memory is 7.1 GB. [2019-04-04 17:46:57,282 INFO L168 Benchmark]: Boogie Printer took 29.41 ms. Allocated memory is still 169.3 MB. Free memory was 128.5 MB in the beginning and 127.7 MB in the end (delta: 739.7 kB). Peak memory consumption was 739.7 kB. Max. memory is 7.1 GB. [2019-04-04 17:46:57,283 INFO L168 Benchmark]: Boogie Preprocessor took 124.11 ms. Allocated memory is still 169.3 MB. Free memory was 127.7 MB in the beginning and 124.0 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:46:57,284 INFO L168 Benchmark]: RCFGBuilder took 3874.86 ms. Allocated memory was 169.3 MB in the beginning and 228.1 MB in the end (delta: 58.7 MB). Free memory was 124.0 MB in the beginning and 169.1 MB in the end (delta: -45.1 MB). Peak memory consumption was 99.3 MB. Max. memory is 7.1 GB. [2019-04-04 17:46:57,285 INFO L168 Benchmark]: TraceAbstraction took 3362.65 ms. Allocated memory was 228.1 MB in the beginning and 313.0 MB in the end (delta: 84.9 MB). Free memory was 169.1 MB in the beginning and 172.4 MB in the end (delta: -3.3 MB). Peak memory consumption was 81.6 MB. Max. memory is 7.1 GB. [2019-04-04 17:46:57,289 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.22 ms. Allocated memory is still 135.3 MB. Free memory was 112.9 MB in the beginning and 112.7 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 1016.26 ms. Allocated memory was 135.3 MB in the beginning and 169.3 MB in the end (delta: 34.1 MB). Free memory was 110.6 MB in the beginning and 128.5 MB in the end (delta: -17.9 MB). Peak memory consumption was 53.5 MB. Max. memory is 7.1 GB. * Boogie Printer took 29.41 ms. Allocated memory is still 169.3 MB. Free memory was 128.5 MB in the beginning and 127.7 MB in the end (delta: 739.7 kB). Peak memory consumption was 739.7 kB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.11 ms. Allocated memory is still 169.3 MB. Free memory was 127.7 MB in the beginning and 124.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3874.86 ms. Allocated memory was 169.3 MB in the beginning and 228.1 MB in the end (delta: 58.7 MB). Free memory was 124.0 MB in the beginning and 169.1 MB in the end (delta: -45.1 MB). Peak memory consumption was 99.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3362.65 ms. Allocated memory was 228.1 MB in the beginning and 313.0 MB in the end (delta: 84.9 MB). Free memory was 169.1 MB in the beginning and 172.4 MB in the end (delta: -3.3 MB). Peak memory consumption was 81.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ReqCheckSuccessResult [Line: -1]: Requirement ID001 is non-vacuous Requirement ID001 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr21ASSERT_VIOLATIONVACUOUSforID001 CFG has 1 procedures, 65 locations, 31 error locations. UNSAFE Result, 0.7s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 24 SDslu, 45 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=65occurred 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, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 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]: Requirement ID005 is non-vacuous Requirement ID005 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr27ASSERT_VIOLATIONVACUOUSforID005 CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 30 NumberOfCodeBlocks, 30 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 ID011, ID006 are rt-consistent Requirements ID011, ID006 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID011_ID006 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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]: Requirements ID000, ID002 are rt-consistent Requirements ID000, ID002 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID000_ID002 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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]: Requirement ID000 is non-vacuous Requirement ID000 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr23ASSERT_VIOLATIONVACUOUSforID000 CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 26 NumberOfCodeBlocks, 26 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: myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID009_ID010 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.5s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 76 SDtfs, 86 SDslu, 86 SDs, 0 SdLazy, 19 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 19/19 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID011, ID001 are rt-consistent Requirements ID011, ID001 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID011_ID001 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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, ID011 are rt-consistent Requirements ID008, ID011 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID008_ID011 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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, 6 NumberOfCodeBlocks, 6 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: myProcedureErr19ASSERT_VIOLATIONVACUOUSforID008 CFG has 1 procedures, 65 locations, 31 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 26 SDslu, 45 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=65occurred 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.1s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 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]: Requirement ID006 is non-vacuous Requirement ID006 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr22ASSERT_VIOLATIONVACUOUSforID006 CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 25 NumberOfCodeBlocks, 25 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 ID008, ID000 are rt-consistent Requirements ID008, ID000 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID008_ID000 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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 ID011, ID005 are rt-consistent Requirements ID011, ID005 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID011_ID005 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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 ID011, ID009 are rt-consistent Requirements ID011, ID009 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID011_ID009 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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, 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 ID004 is non-vacuous Requirement ID004 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr24ASSERT_VIOLATIONVACUOUSforID004 CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 27 NumberOfCodeBlocks, 27 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 ID001, ID000 are rt-consistent Requirements ID001, ID000 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID001_ID000 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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.1s 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 ID010 is non-vacuous Requirement ID010 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr28ASSERT_VIOLATIONVACUOUSforID010 CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 31 NumberOfCodeBlocks, 31 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 ID011 is non-vacuous Requirement ID011 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr20ASSERT_VIOLATIONVACUOUSforID011 CFG has 1 procedures, 65 locations, 31 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 24 SDslu, 44 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.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 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]: Requirement ID009 is non-vacuous Requirement ID009 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr25ASSERT_VIOLATIONVACUOUSforID009 CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 28 NumberOfCodeBlocks, 28 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 ID007, ID011 are rt-consistent Requirements ID007, ID011 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID007_ID011 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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, 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 ID011, ID000 are rt-consistent Requirements ID011, ID000 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID011_ID000 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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, 11 NumberOfCodeBlocks, 11 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: myProcedureErr29ASSERT_VIOLATIONVACUOUSforID003 CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 32 NumberOfCodeBlocks, 32 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 ID011, ID002 are rt-consistent Requirements ID011, ID002 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID011_ID002 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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]: Requirements ID007, ID001 are rt-consistent Requirements ID007, ID001 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID007_ID001 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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 ID007, ID008 are rt-consistent Requirements ID007, ID008 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID007_ID008 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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, 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: myProcedureErr30ASSERT_VIOLATIONCONSISTENCYforallrequirements CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 33 NumberOfCodeBlocks, 33 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 ID002 is non-vacuous Requirement ID002 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr26ASSERT_VIOLATIONVACUOUSforID002 CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 29 NumberOfCodeBlocks, 29 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 ID008, ID001 are rt-consistent Requirements ID008, ID001 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID008_ID001 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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]: Requirements ID011, ID010 are rt-consistent Requirements ID011, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.5s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 78 SDtfs, 62 SDslu, 88 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.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 15/15 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: myProcedureErr18ASSERT_VIOLATIONVACUOUSforID007 CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 21 NumberOfCodeBlocks, 21 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 ID011, ID003 are rt-consistent Requirements ID011, ID003 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID011_ID003 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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 ID011, ID004 are rt-consistent Requirements ID011, ID004 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID011_ID004 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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 RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...