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-05 11:56:33,632 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-04-05 11:56:33,636 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-04-05 11:56:33,648 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-04-05 11:56:33,649 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-04-05 11:56:33,650 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-04-05 11:56:33,651 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-04-05 11:56:33,653 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-04-05 11:56:33,655 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-04-05 11:56:33,656 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-04-05 11:56:33,657 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-04-05 11:56:33,657 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-04-05 11:56:33,658 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-04-05 11:56:33,659 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-04-05 11:56:33,660 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-04-05 11:56:33,661 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-04-05 11:56:33,662 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-04-05 11:56:33,664 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-04-05 11:56:33,666 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-04-05 11:56:33,667 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-04-05 11:56:33,669 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-04-05 11:56:33,670 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-04-05 11:56:33,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-04-05 11:56:33,673 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-04-05 11:56:33,673 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-04-05 11:56:33,674 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-04-05 11:56:33,674 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-04-05 11:56:33,675 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-04-05 11:56:33,676 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-04-05 11:56:33,676 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-04-05 11:56:33,677 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-04-05 11:56:33,678 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-04-05 11:56:33,679 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-04-05 11:56:33,679 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-04-05 11:56:33,680 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-04-05 11:56:33,680 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-04-05 11:56:33,681 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-04-05 11:56:33,682 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-04-05 11:56:33,682 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-04-05 11:56:33,683 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/trunk/examples/settings/reqanalyzer/reqanalyzer-nonlin.epf [2019-04-05 11:56:33,699 INFO L110 SettingsManager]: Loading preferences was successful [2019-04-05 11:56:33,700 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-04-05 11:56:33,701 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-04-05 11:56:33,701 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2019-04-05 11:56:33,702 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-04-05 11:56:33,702 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:12000 [2019-04-05 11:56:33,702 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-04-05 11:56:33,702 INFO L133 SettingsManager]: * Trace refinement exception blacklist=UNKNOWN [2019-04-05 11:56:33,702 INFO L133 SettingsManager]: * Stop after first violation was found=false [2019-04-05 11:56:33,703 INFO L133 SettingsManager]: * Compute statistics for interpolant sequences=false [2019-04-05 11:56:33,703 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM [2019-04-05 11:56:33,703 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-04-05 11:56:33,703 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-05 11:56:33,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-04-05 11:56:33,752 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-04-05 11:56:33,756 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-04-05 11:56:33,758 INFO L271 PluginConnector]: Initializing ReqParser... [2019-04-05 11:56:33,759 INFO L276 PluginConnector]: ReqParser initialized [2019-04-05 11:56:33,759 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/re2019-exp/hybrid1_extended.new.req [2019-04-05 11:56:33,760 INFO L94 ReqParser]: Parsing file /storage/repos/re2019-exp/hybrid1_extended.new.req [2019-04-05 11:56:33,820 INFO L134 ReqParser]: 23 requirements (12 non-initialization) in total [2019-04-05 11:56:33,827 INFO L134 ReqParser]: 23 requirements (12 non-initialization) after unification [2019-04-05 11:56:33,832 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-04-05 11:56:33,834 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-04-05 11:56:33,834 INFO L113 PluginConnector]: ------------------------PEA to Boogie---------------------------- [2019-04-05 11:56:33,834 INFO L271 PluginConnector]: Initializing PEA to Boogie... [2019-04-05 11:56:33,835 INFO L276 PluginConnector]: PEA to Boogie initialized [2019-04-05 11:56:33,837 INFO L185 PluginConnector]: Executing the observer PEAtoBoogieObserver from plugin PEA to Boogie for "de.uni_freiburg.informatik.ultimate.reqparser OTHER 05.04 11:56:33" (1/1) ... [2019-04-05 11:56:33,846 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-05 11:56:33,857 INFO L59 ReqToPEA]: Transforming 12 requirements to PEAs [2019-04-05 11:56:33,896 INFO L87 ReqToPEA]: Following types of requirements were processed [2019-04-05 11:56:33,899 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.BndInvariancePattern : 3 [2019-04-05 11:56:33,899 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.MaxDurationPattern : 3 [2019-04-05 11:56:33,899 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.BndResponsePatternUT : 4 [2019-04-05 11:56:33,900 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.MinDurationPattern : 2 [2019-04-05 11:56:33,900 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-05 11:56:34,149 INFO L154 cyConditionGenerator]: Finished generating primed state invariant of size 1 [2019-04-05 11:56:34,175 INFO L769 Req2BoogieTranslator]: 0 of 12 requirements are invariant [2019-04-05 11:56:34,176 INFO L786 Req2BoogieTranslator]: Computing rt-inconsistency assertions for 66 subsets [2019-04-05 11:56:34,844 INFO L284 cyConditionGenerator]: 66 checks, 48 trivial consistent, 18 non-trivial [2019-04-05 11:56:34,845 INFO L290 cyConditionGenerator]: Of 693 formulas, 0 were quantified, 693 were plain. Needed 267 quantifier elimination runs, 0 quantified solver queries. [2019-04-05 11:56:34,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:34 Unit [2019-04-05 11:56:34,867 INFO L132 PluginConnector]: ------------------------ END PEA to Boogie---------------------------- [2019-04-05 11:56:34,868 INFO L113 PluginConnector]: ------------------------Boogie Printer---------------------------- [2019-04-05 11:56:34,868 INFO L271 PluginConnector]: Initializing Boogie Printer... [2019-04-05 11:56:34,868 INFO L276 PluginConnector]: Boogie Printer initialized [2019-04-05 11:56:34,869 INFO L185 PluginConnector]: Executing the observer BoogiePrinterObserver from plugin Boogie Printer for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:34" (1/1) ... [2019-04-05 11:56:34,870 INFO L116 oogiePrinterObserver]: File already exists and will be overwritten: /tmp/boogiePrinter.bpl [2019-04-05 11:56:34,870 INFO L120 oogiePrinterObserver]: Writing to file /tmp/boogiePrinter.bpl [2019-04-05 11:56:34,895 INFO L132 PluginConnector]: ------------------------ END Boogie Printer---------------------------- [2019-04-05 11:56:34,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-04-05 11:56:34,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-04-05 11:56:34,896 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-04-05 11:56:34,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:34" (1/1) ... [2019-04-05 11:56:34,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:34" (1/1) ... [2019-04-05 11:56:34,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:34" (1/1) ... [2019-04-05 11:56:34,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:34" (1/1) ... [2019-04-05 11:56:34,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:34" (1/1) ... [2019-04-05 11:56:34,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:34" (1/1) ... [2019-04-05 11:56:34,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:34" (1/1) ... [2019-04-05 11:56:34,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-04-05 11:56:34,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-04-05 11:56:34,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-04-05 11:56:34,995 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-04-05 11:56:34,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:34" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:12000 [2019-04-05 11:56:35,014 INFO L124 BoogieDeclarations]: Specification and implementation of procedure myProcedure given in one single declaration [2019-04-05 11:56:35,015 INFO L130 BoogieDeclarations]: Found specification of procedure myProcedure [2019-04-05 11:56:35,015 INFO L138 BoogieDeclarations]: Found implementation of procedure myProcedure [2019-04-05 11:56:38,631 INFO L278 CfgBuilder]: Using library mode [2019-04-05 11:56:38,632 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-04-05 11:56:38,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 11:56:38 BoogieIcfgContainer [2019-04-05 11:56:38,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-04-05 11:56:38,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-04-05 11:56:38,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-04-05 11:56:38,637 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-04-05 11:56:38,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.reqparser OTHER 05.04 11:56:33" (1/3) ... [2019-04-05 11:56:38,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad5b6a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 05.04 11:56:38, skipping insertion in model container [2019-04-05 11:56:38,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:34" (2/3) ... [2019-04-05 11:56:38,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad5b6a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 11:56:38, skipping insertion in model container [2019-04-05 11:56:38,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 11:56:38" (3/3) ... [2019-04-05 11:56:38,641 INFO L112 eAbstractionObserver]: Analyzing ICFG [2019-04-05 11:56:38,650 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-04-05 11:56:38,655 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-04-05 11:56:38,674 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:38,697 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:38,697 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:38,698 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:38,698 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:38,698 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:38,698 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:38,698 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:38,699 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID009_ID011======== [2019-04-05 11:56:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:38,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-04-05 11:56:38,722 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:38,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-04-05 11:56:38,723 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID009_ID011]=== [2019-04-05 11:56:38,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:38,729 INFO L82 PathProgramCache]: Analyzing trace with hash 66924, now seen corresponding path program 1 times [2019-04-05 11:56:38,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:38,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:38,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:38,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:38,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:38,892 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-05 11:56:38,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:38,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:38,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:38,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:38,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:38,918 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-05 11:56:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:38,931 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-05 11:56:38,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:38,932 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 3 [2019-04-05 11:56:38,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:38,940 INFO L225 Difference]: With dead ends: 49 [2019-04-05 11:56:38,940 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:38,942 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-05 11:56:38,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:38,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 [2019-04-05 11:56:38,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:38,965 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:38,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:38,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:38,968 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID009_ID011 was SAFE (1/31) [2019-04-05 11:56:38,970 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:38,970 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:38,970 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:38,970 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:38,971 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:38,971 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:38,971 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:38,971 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:38,971 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID001_ID011======== [2019-04-05 11:56:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:38,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-04-05 11:56:38,974 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:38,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-04-05 11:56:38,974 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID001_ID011]=== [2019-04-05 11:56:38,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:38,975 INFO L82 PathProgramCache]: Analyzing trace with hash 64321806, now seen corresponding path program 1 times [2019-04-05 11:56:38,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:38,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:38,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:38,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:38,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:39,059 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-05 11:56:39,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:39,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:39,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:39,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:39,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:39,060 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-05 11:56:39,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:39,067 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-05 11:56:39,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:39,067 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-04-05 11:56:39,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:39,067 INFO L225 Difference]: With dead ends: 49 [2019-04-05 11:56:39,067 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:39,068 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-05 11:56:39,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:39,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:39,069 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-04-05 11:56:39,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:39,069 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:39,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:39,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:39,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:39,070 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID001_ID011 was SAFE (2/31) [2019-04-05 11:56:39,072 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:39,072 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:39,072 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:39,072 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:39,072 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:39,072 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:39,073 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:39,073 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:39,073 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr29ASSERT_VIOLATIONVACUOUSforID008======== [2019-04-05 11:56:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-04-05 11:56:39,079 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:39,079 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-05 11:56:39,079 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr29ASSERT_VIOLATIONVACUOUSforID008]=== [2019-04-05 11:56:39,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:39,080 INFO L82 PathProgramCache]: Analyzing trace with hash -276573723, now seen corresponding path program 1 times [2019-04-05 11:56:39,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:39,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:39,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:39,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:39,242 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-05 11:56:39,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:39,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:39,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-05 11:56:39,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-05 11:56:39,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 11:56:39,244 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-04-05 11:56:39,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:39,354 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-04-05 11:56:39,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 11:56:39,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-04-05 11:56:39,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:39,358 INFO L225 Difference]: With dead ends: 96 [2019-04-05 11:56:39,358 INFO L226 Difference]: Without dead ends: 66 [2019-04-05 11:56:39,359 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-05 11:56:39,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-04-05 11:56:39,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-04-05 11:56:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-04-05 11:56:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-04-05 11:56:39,374 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 32 [2019-04-05 11:56:39,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:39,374 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-04-05 11:56:39,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-05 11:56:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-04-05 11:56:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-04-05 11:56:39,377 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:39,377 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-04-05 11:56:39,377 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr29ASSERT_VIOLATIONVACUOUSforID008]=== [2019-04-05 11:56:39,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:39,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1980943474, now seen corresponding path program 1 times [2019-04-05 11:56:39,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:39,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:39,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:39,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:39,483 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:39,494 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr29ASSERT_VIOLATIONVACUOUSforID008 was UNSAFE (3/31) [2019-04-05 11:56:39,495 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:39,496 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:39,497 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:39,497 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:39,497 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:39,497 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:39,497 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:39,497 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:39,497 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr24ASSERT_VIOLATIONVACUOUSforID002======== [2019-04-05 11:56:39,501 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:39,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-04-05 11:56:39,503 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:39,503 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-05 11:56:39,503 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr24ASSERT_VIOLATIONVACUOUSforID002]=== [2019-04-05 11:56:39,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:39,503 INFO L82 PathProgramCache]: Analyzing trace with hash 107065604, now seen corresponding path program 1 times [2019-04-05 11:56:39,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:39,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:39,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:39,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:39,539 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:39,540 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr24ASSERT_VIOLATIONVACUOUSforID002 was UNSAFE (4/31) [2019-04-05 11:56:39,540 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:39,541 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:39,541 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:39,541 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:39,541 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:39,541 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:39,541 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:39,541 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:39,542 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID002_ID000======== [2019-04-05 11:56:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:39,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-04-05 11:56:39,547 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:39,547 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-05 11:56:39,547 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID002_ID000]=== [2019-04-05 11:56:39,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:39,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2137027209, now seen corresponding path program 1 times [2019-04-05 11:56:39,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:39,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:39,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:39,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:39,589 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-05 11:56:39,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:39,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:39,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:39,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:39,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:39,590 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-05 11:56:39,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:39,593 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-05 11:56:39,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:39,594 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-04-05 11:56:39,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:39,594 INFO L225 Difference]: With dead ends: 49 [2019-04-05 11:56:39,594 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:39,595 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-05 11:56:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:39,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:39,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:39,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:39,595 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-04-05 11:56:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:39,596 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:39,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:39,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:39,597 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID002_ID000 was SAFE (5/31) [2019-04-05 11:56:39,597 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:39,598 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:39,598 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:39,598 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:39,598 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:39,598 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:39,598 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:39,599 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:39,599 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr28ASSERT_VIOLATIONVACUOUSforID007======== [2019-04-05 11:56:39,600 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:39,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-04-05 11:56:39,601 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:39,602 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-05 11:56:39,602 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr28ASSERT_VIOLATIONVACUOUSforID007]=== [2019-04-05 11:56:39,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:39,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1394395064, now seen corresponding path program 1 times [2019-04-05 11:56:39,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:39,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:39,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:39,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:39,616 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:39,617 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr28ASSERT_VIOLATIONVACUOUSforID007 was UNSAFE (6/31) [2019-04-05 11:56:39,618 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:39,618 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:39,618 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:39,618 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:39,618 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:39,618 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:39,619 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:39,619 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:39,619 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr18ASSERT_VIOLATIONVACUOUSforID009======== [2019-04-05 11:56:39,620 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:39,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-04-05 11:56:39,621 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:39,621 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-05 11:56:39,621 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr18ASSERT_VIOLATIONVACUOUSforID009]=== [2019-04-05 11:56:39,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:39,622 INFO L82 PathProgramCache]: Analyzing trace with hash 122918430, now seen corresponding path program 1 times [2019-04-05 11:56:39,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:39,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:39,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:39,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:39,638 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:39,639 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr18ASSERT_VIOLATIONVACUOUSforID009 was UNSAFE (7/31) [2019-04-05 11:56:39,640 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:39,641 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:39,641 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:39,641 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:39,641 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:39,641 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:39,641 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:39,641 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:39,642 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr26ASSERT_VIOLATIONVACUOUSforID010======== [2019-04-05 11:56:39,643 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:39,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-04-05 11:56:39,645 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:39,645 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-05 11:56:39,645 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr26ASSERT_VIOLATIONVACUOUSforID010]=== [2019-04-05 11:56:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:39,647 INFO L82 PathProgramCache]: Analyzing trace with hash -189160282, now seen corresponding path program 1 times [2019-04-05 11:56:39,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:39,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:39,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:39,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:39,660 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:39,661 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr26ASSERT_VIOLATIONVACUOUSforID010 was UNSAFE (8/31) [2019-04-05 11:56:39,666 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:39,666 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:39,666 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:39,666 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:39,667 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:39,667 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:39,667 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:39,667 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:39,667 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID011_ID005======== [2019-04-05 11:56:39,668 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:39,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-04-05 11:56:39,669 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:39,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:39,669 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID011_ID005]=== [2019-04-05 11:56:39,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:39,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2030536598, now seen corresponding path program 1 times [2019-04-05 11:56:39,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:39,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:39,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:39,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:39,693 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-05 11:56:39,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:39,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:39,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:39,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:39,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:39,696 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-05 11:56:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:39,702 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-05 11:56:39,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:39,702 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-04-05 11:56:39,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:39,703 INFO L225 Difference]: With dead ends: 49 [2019-04-05 11:56:39,703 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:39,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:39,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:39,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:39,707 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-04-05 11:56:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:39,707 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:39,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:39,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:39,708 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID011_ID005 was SAFE (9/31) [2019-04-05 11:56:39,709 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:39,709 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:39,709 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:39,709 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:39,710 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:39,710 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:39,711 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:39,711 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:39,711 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr20ASSERT_VIOLATIONVACUOUSforID011======== [2019-04-05 11:56:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-04-05 11:56:39,718 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:39,718 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-05 11:56:39,718 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr20ASSERT_VIOLATIONVACUOUSforID011]=== [2019-04-05 11:56:39,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:39,719 INFO L82 PathProgramCache]: Analyzing trace with hash -2134464064, now seen corresponding path program 1 times [2019-04-05 11:56:39,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:39,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:39,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:39,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:39,853 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-05 11:56:39,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:39,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:39,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-05 11:56:39,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-05 11:56:39,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 11:56:39,857 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-04-05 11:56:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:39,962 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-04-05 11:56:39,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 11:56:39,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-04-05 11:56:39,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:39,965 INFO L225 Difference]: With dead ends: 95 [2019-04-05 11:56:39,965 INFO L226 Difference]: Without dead ends: 66 [2019-04-05 11:56:39,965 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-05 11:56:39,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-04-05 11:56:39,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2019-04-05 11:56:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-04-05 11:56:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-04-05 11:56:39,971 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 23 [2019-04-05 11:56:39,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:39,972 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-04-05 11:56:39,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-05 11:56:39,972 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-04-05 11:56:39,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-04-05 11:56:39,973 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:39,974 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-05 11:56:39,974 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr20ASSERT_VIOLATIONVACUOUSforID011]=== [2019-04-05 11:56:39,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:39,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1010952713, now seen corresponding path program 1 times [2019-04-05 11:56:39,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:39,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:39,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:39,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:40,020 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:40,021 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr20ASSERT_VIOLATIONVACUOUSforID011 was UNSAFE (10/31) [2019-04-05 11:56:40,025 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:40,025 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:40,025 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:40,025 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:40,025 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:40,026 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:40,026 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:40,028 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:40,029 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID009_ID010======== [2019-04-05 11:56:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-04-05 11:56:40,030 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-04-05 11:56:40,030 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID009_ID010]=== [2019-04-05 11:56:40,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2074889, now seen corresponding path program 1 times [2019-04-05 11:56:40,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:40,135 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-05 11:56:40,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:40,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 11:56:40,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-05 11:56:40,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-05 11:56:40,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 11:56:40,137 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-04-05 11:56:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:40,184 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-04-05 11:56:40,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 11:56:40,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-04-05 11:56:40,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:40,185 INFO L225 Difference]: With dead ends: 47 [2019-04-05 11:56:40,185 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:40,185 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-05 11:56:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:40,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:40,186 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-04-05 11:56:40,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:40,186 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:40,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-05 11:56:40,186 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:40,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:40,187 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID009_ID010 was SAFE (11/31) [2019-04-05 11:56:40,188 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:40,188 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:40,188 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:40,188 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:40,188 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:40,189 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:40,189 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:40,189 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:40,189 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID001_ID008======== [2019-04-05 11:56:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-04-05 11:56:40,190 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:40,191 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID001_ID008]=== [2019-04-05 11:56:40,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,191 INFO L82 PathProgramCache]: Analyzing trace with hash 655755853, now seen corresponding path program 1 times [2019-04-05 11:56:40,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:40,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-05 11:56:40,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:40,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:40,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:40,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:40,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:40,231 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-05 11:56:40,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:40,232 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-05 11:56:40,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:40,234 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-04-05 11:56:40,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:40,234 INFO L225 Difference]: With dead ends: 49 [2019-04-05 11:56:40,234 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:40,234 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-05 11:56:40,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:40,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:40,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:40,235 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-04-05 11:56:40,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:40,236 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:40,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:40,236 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:40,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:40,236 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID001_ID008 was SAFE (12/31) [2019-04-05 11:56:40,237 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:40,237 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:40,238 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:40,238 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:40,238 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:40,238 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:40,239 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:40,239 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:40,239 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr23ASSERT_VIOLATIONVACUOUSforID006======== [2019-04-05 11:56:40,240 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:40,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-04-05 11:56:40,240 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,240 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-05 11:56:40,241 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr23ASSERT_VIOLATIONVACUOUSforID006]=== [2019-04-05 11:56:40,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,245 INFO L82 PathProgramCache]: Analyzing trace with hash -827830273, now seen corresponding path program 1 times [2019-04-05 11:56:40,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:40,259 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:40,260 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr23ASSERT_VIOLATIONVACUOUSforID006 was UNSAFE (13/31) [2019-04-05 11:56:40,262 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:40,262 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:40,262 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:40,262 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:40,262 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:40,263 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:40,263 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:40,263 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:40,263 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID001_ID007======== [2019-04-05 11:56:40,264 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:40,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-04-05 11:56:40,264 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:40,264 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID001_ID007]=== [2019-04-05 11:56:40,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1683721392, now seen corresponding path program 1 times [2019-04-05 11:56:40,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:40,282 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-05 11:56:40,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:40,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:40,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:40,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:40,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:40,284 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-05 11:56:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:40,286 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-05 11:56:40,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:40,286 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2019-04-05 11:56:40,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:40,287 INFO L225 Difference]: With dead ends: 49 [2019-04-05 11:56:40,291 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:40,292 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-05 11:56:40,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:40,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:40,293 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-04-05 11:56:40,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:40,293 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:40,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:40,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:40,294 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID001_ID007 was SAFE (14/31) [2019-04-05 11:56:40,295 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:40,295 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:40,295 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:40,295 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:40,296 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:40,296 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:40,296 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:40,296 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:40,296 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID000_ID008======== [2019-04-05 11:56:40,297 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-04-05 11:56:40,297 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,297 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-05 11:56:40,298 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID000_ID008]=== [2019-04-05 11:56:40,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1823333764, now seen corresponding path program 1 times [2019-04-05 11:56:40,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:40,323 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-05 11:56:40,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:40,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:40,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:40,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:40,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:40,327 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-05 11:56:40,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:40,328 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-05 11:56:40,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:40,328 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-04-05 11:56:40,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:40,329 INFO L225 Difference]: With dead ends: 49 [2019-04-05 11:56:40,329 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:40,329 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-05 11:56:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:40,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:40,330 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-04-05 11:56:40,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:40,330 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:40,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:40,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:40,331 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID000_ID008 was SAFE (15/31) [2019-04-05 11:56:40,335 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:40,336 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:40,336 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:40,336 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:40,336 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:40,336 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:40,336 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:40,336 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:40,337 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_ID000======== [2019-04-05 11:56:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-04-05 11:56:40,338 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-04-05 11:56:40,338 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_ID000]=== [2019-04-05 11:56:40,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1993976235, now seen corresponding path program 1 times [2019-04-05 11:56:40,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:40,358 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-05 11:56:40,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:40,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:40,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:40,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:40,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:40,359 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-05 11:56:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:40,360 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-05 11:56:40,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:40,360 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-04-05 11:56:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:40,361 INFO L225 Difference]: With dead ends: 49 [2019-04-05 11:56:40,361 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:40,361 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-05 11:56:40,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:40,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:40,362 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-04-05 11:56:40,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:40,362 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:40,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:40,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:40,363 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_ID000 was SAFE (16/31) [2019-04-05 11:56:40,363 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:40,364 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:40,364 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:40,364 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:40,364 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:40,364 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:40,364 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:40,364 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:40,364 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID011_ID004======== [2019-04-05 11:56:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:40,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-04-05 11:56:40,366 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:40,367 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID011_ID004]=== [2019-04-05 11:56:40,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1178809617, now seen corresponding path program 1 times [2019-04-05 11:56:40,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:40,383 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-05 11:56:40,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:40,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:40,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:40,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:40,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:40,384 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-05 11:56:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:40,385 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-05 11:56:40,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:40,385 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-04-05 11:56:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:40,386 INFO L225 Difference]: With dead ends: 49 [2019-04-05 11:56:40,386 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:40,386 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-05 11:56:40,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:40,393 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-04-05 11:56:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:40,393 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:40,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:40,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:40,394 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID011_ID004 was SAFE (17/31) [2019-04-05 11:56:40,395 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:40,395 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:40,395 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:40,395 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:40,395 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:40,395 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:40,395 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:40,395 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:40,396 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr25ASSERT_VIOLATIONVACUOUSforID005======== [2019-04-05 11:56:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:40,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-04-05 11:56:40,399 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,399 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-05 11:56:40,399 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr25ASSERT_VIOLATIONVACUOUSforID005]=== [2019-04-05 11:56:40,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,399 INFO L82 PathProgramCache]: Analyzing trace with hash -975933279, now seen corresponding path program 1 times [2019-04-05 11:56:40,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:40,410 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:40,411 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr25ASSERT_VIOLATIONVACUOUSforID005 was UNSAFE (18/31) [2019-04-05 11:56:40,411 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:40,412 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:40,412 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:40,413 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:40,413 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:40,413 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:40,413 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:40,413 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:40,413 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr22ASSERT_VIOLATIONVACUOUSforID004======== [2019-04-05 11:56:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:40,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-04-05 11:56:40,415 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,415 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-05 11:56:40,415 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr22ASSERT_VIOLATIONVACUOUSforID004]=== [2019-04-05 11:56:40,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1774411106, now seen corresponding path program 1 times [2019-04-05 11:56:40,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:40,425 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:40,426 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr22ASSERT_VIOLATIONVACUOUSforID004 was UNSAFE (19/31) [2019-04-05 11:56:40,427 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:40,427 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:40,427 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:40,427 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:40,427 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:40,428 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:40,428 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:40,428 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:40,429 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID007_ID008======== [2019-04-05 11:56:40,429 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:40,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-04-05 11:56:40,430 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,430 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-05 11:56:40,430 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID007_ID008]=== [2019-04-05 11:56:40,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,430 INFO L82 PathProgramCache]: Analyzing trace with hash -688771559, now seen corresponding path program 1 times [2019-04-05 11:56:40,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:40,446 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-05 11:56:40,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:40,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:40,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:40,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:40,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:40,447 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-05 11:56:40,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:40,448 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-05 11:56:40,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:40,449 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2019-04-05 11:56:40,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:40,449 INFO L225 Difference]: With dead ends: 49 [2019-04-05 11:56:40,449 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:40,449 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-05 11:56:40,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:40,451 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-04-05 11:56:40,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:40,451 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:40,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:40,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:40,452 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID007_ID008 was SAFE (20/31) [2019-04-05 11:56:40,452 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:40,452 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:40,453 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:40,453 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:40,455 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:40,455 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:40,455 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:40,455 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:40,456 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr30ASSERT_VIOLATIONCONSISTENCYforallrequirements======== [2019-04-05 11:56:40,456 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-04-05 11:56:40,457 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,457 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-05 11:56:40,457 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr30ASSERT_VIOLATIONCONSISTENCYforallrequirements]=== [2019-04-05 11:56:40,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,458 INFO L82 PathProgramCache]: Analyzing trace with hash 16149482, now seen corresponding path program 1 times [2019-04-05 11:56:40,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:40,467 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:40,467 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr30ASSERT_VIOLATIONCONSISTENCYforallrequirements was UNSAFE (21/31) [2019-04-05 11:56:40,468 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:40,469 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:40,469 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:40,469 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:40,469 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:40,469 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:40,469 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:40,469 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:40,469 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr27ASSERT_VIOLATIONVACUOUSforID000======== [2019-04-05 11:56:40,470 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:40,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-04-05 11:56:40,471 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,472 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-05 11:56:40,472 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr27ASSERT_VIOLATIONVACUOUSforID000]=== [2019-04-05 11:56:40,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1569001149, now seen corresponding path program 1 times [2019-04-05 11:56:40,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:40,483 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:40,483 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr27ASSERT_VIOLATIONVACUOUSforID000 was UNSAFE (22/31) [2019-04-05 11:56:40,485 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:40,486 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:40,486 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:40,486 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:40,486 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:40,486 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:40,486 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:40,486 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:40,486 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr21ASSERT_VIOLATIONVACUOUSforID003======== [2019-04-05 11:56:40,487 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:40,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-04-05 11:56:40,488 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,488 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-05 11:56:40,488 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr21ASSERT_VIOLATIONVACUOUSforID003]=== [2019-04-05 11:56:40,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1743876259, now seen corresponding path program 1 times [2019-04-05 11:56:40,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:40,505 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:40,506 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr21ASSERT_VIOLATIONVACUOUSforID003 was UNSAFE (23/31) [2019-04-05 11:56:40,507 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:40,507 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:40,507 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:40,507 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:40,507 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:40,507 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:40,507 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:40,507 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:40,508 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010======== [2019-04-05 11:56:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:40,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-04-05 11:56:40,509 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:40,509 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010]=== [2019-04-05 11:56:40,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1477874637, now seen corresponding path program 1 times [2019-04-05 11:56:40,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:40,757 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-05 11:56:40,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:40,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 11:56:40,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-05 11:56:40,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-05 11:56:40,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-04-05 11:56:40,759 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 4 states. [2019-04-05 11:56:40,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:40,822 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-04-05 11:56:40,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 11:56:40,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-04-05 11:56:40,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:40,825 INFO L225 Difference]: With dead ends: 95 [2019-04-05 11:56:40,825 INFO L226 Difference]: Without dead ends: 66 [2019-04-05 11:56:40,826 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-05 11:56:40,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-04-05 11:56:40,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2019-04-05 11:56:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-04-05 11:56:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-04-05 11:56:40,836 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 14 [2019-04-05 11:56:40,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:40,836 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-04-05 11:56:40,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-05 11:56:40,836 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-04-05 11:56:40,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-04-05 11:56:40,837 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,837 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-04-05 11:56:40,837 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010]=== [2019-04-05 11:56:40,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1892149732, now seen corresponding path program 1 times [2019-04-05 11:56:40,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-05 11:56:40,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:40,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 11:56:40,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-05 11:56:40,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-05 11:56:40,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 11:56:40,980 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 3 states. [2019-04-05 11:56:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:41,049 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-04-05 11:56:41,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 11:56:41,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-04-05 11:56:41,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:41,051 INFO L225 Difference]: With dead ends: 46 [2019-04-05 11:56:41,051 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:41,053 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-05 11:56:41,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:41,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:41,058 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2019-04-05 11:56:41,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:41,058 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:41,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-05 11:56:41,059 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:41,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:41,059 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010 was SAFE (24/31) [2019-04-05 11:56:41,060 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:41,061 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:41,061 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:41,062 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:41,062 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:41,062 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:41,062 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:41,062 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:41,062 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID011_ID003======== [2019-04-05 11:56:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-04-05 11:56:41,064 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:41,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:41,064 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID011_ID003]=== [2019-04-05 11:56:41,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:41,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1146404782, now seen corresponding path program 1 times [2019-04-05 11:56:41,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:41,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:41,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:41,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:41,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:41,094 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-05 11:56:41,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:41,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:41,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:41,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:41,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:41,096 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-05 11:56:41,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:41,098 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-05 11:56:41,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:41,099 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-04-05 11:56:41,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:41,099 INFO L225 Difference]: With dead ends: 49 [2019-04-05 11:56:41,099 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:41,100 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-05 11:56:41,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:41,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:41,101 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-04-05 11:56:41,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:41,101 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:41,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:41,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:41,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:41,103 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID011_ID003 was SAFE (25/31) [2019-04-05 11:56:41,104 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:41,104 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:41,105 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:41,105 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:41,105 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:41,105 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:41,105 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:41,105 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:41,106 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID011_ID000======== [2019-04-05 11:56:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:41,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-04-05 11:56:41,108 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:41,108 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:41,108 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID011_ID000]=== [2019-04-05 11:56:41,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:41,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1430526776, now seen corresponding path program 1 times [2019-04-05 11:56:41,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:41,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:41,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:41,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:41,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:41,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:41,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:41,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:41,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:41,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:41,131 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-05 11:56:41,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:41,132 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-05 11:56:41,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:41,133 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-04-05 11:56:41,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:41,133 INFO L225 Difference]: With dead ends: 49 [2019-04-05 11:56:41,134 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:41,134 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-05 11:56:41,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:41,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:41,136 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-04-05 11:56:41,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:41,136 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:41,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:41,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:41,138 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID011_ID000 was SAFE (26/31) [2019-04-05 11:56:41,138 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:41,139 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:41,139 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:41,139 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:41,139 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:41,139 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:41,140 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:41,141 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:41,142 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr19ASSERT_VIOLATIONVACUOUSforID001======== [2019-04-05 11:56:41,142 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-04-05 11:56:41,143 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:41,143 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-05 11:56:41,143 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr19ASSERT_VIOLATIONVACUOUSforID001]=== [2019-04-05 11:56:41,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:41,143 INFO L82 PathProgramCache]: Analyzing trace with hash -484495685, now seen corresponding path program 1 times [2019-04-05 11:56:41,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:41,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:41,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:41,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:41,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:41,263 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-05 11:56:41,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:41,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:41,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-05 11:56:41,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-05 11:56:41,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 11:56:41,265 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-04-05 11:56:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:41,351 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-04-05 11:56:41,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 11:56:41,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-04-05 11:56:41,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:41,353 INFO L225 Difference]: With dead ends: 96 [2019-04-05 11:56:41,354 INFO L226 Difference]: Without dead ends: 66 [2019-04-05 11:56:41,354 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-05 11:56:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-04-05 11:56:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2019-04-05 11:56:41,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-04-05 11:56:41,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-04-05 11:56:41,365 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 22 [2019-04-05 11:56:41,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:41,366 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-04-05 11:56:41,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-05 11:56:41,367 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-04-05 11:56:41,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-04-05 11:56:41,367 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:41,368 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-05 11:56:41,368 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr19ASSERT_VIOLATIONVACUOUSforID001]=== [2019-04-05 11:56:41,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:41,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1140990044, now seen corresponding path program 1 times [2019-04-05 11:56:41,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:41,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:41,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:41,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:41,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:41,419 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:41,423 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr19ASSERT_VIOLATIONVACUOUSforID001 was UNSAFE (27/31) [2019-04-05 11:56:41,424 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:41,424 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:41,424 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:41,424 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:41,425 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:41,425 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:41,425 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:41,425 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:41,425 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID011_ID006======== [2019-04-05 11:56:41,429 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-04-05 11:56:41,429 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:41,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:41,429 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID011_ID006]=== [2019-04-05 11:56:41,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:41,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2111607796, now seen corresponding path program 1 times [2019-04-05 11:56:41,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:41,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:41,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:41,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:41,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:41,451 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-05 11:56:41,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:41,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:41,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:41,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:41,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:41,452 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-05 11:56:41,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:41,453 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-05 11:56:41,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:41,453 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-04-05 11:56:41,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:41,453 INFO L225 Difference]: With dead ends: 49 [2019-04-05 11:56:41,453 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:41,454 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-05 11:56:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:41,455 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-04-05 11:56:41,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:41,455 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:41,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:41,455 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:41,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:41,456 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID011_ID006 was SAFE (28/31) [2019-04-05 11:56:41,456 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:41,458 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:41,458 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:41,458 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:41,458 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:41,458 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:41,458 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:41,459 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:41,459 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID011_ID008======== [2019-04-05 11:56:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:41,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-04-05 11:56:41,460 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:41,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:41,460 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID011_ID008]=== [2019-04-05 11:56:41,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:41,461 INFO L82 PathProgramCache]: Analyzing trace with hash 346705626, now seen corresponding path program 1 times [2019-04-05 11:56:41,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:41,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:41,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:41,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:41,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:41,481 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-05 11:56:41,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:41,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:41,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:41,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:41,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:41,482 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-05 11:56:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:41,484 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-05 11:56:41,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:41,484 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-04-05 11:56:41,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:41,484 INFO L225 Difference]: With dead ends: 49 [2019-04-05 11:56:41,484 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:41,485 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-05 11:56:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:41,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:41,485 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-04-05 11:56:41,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:41,486 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:41,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:41,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:41,487 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID011_ID008 was SAFE (29/31) [2019-04-05 11:56:41,487 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:41,488 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:41,488 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:41,488 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:41,488 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:41,488 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:41,488 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:41,488 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:41,488 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID011_ID007======== [2019-04-05 11:56:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-04-05 11:56:41,489 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:41,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:41,490 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID011_ID007]=== [2019-04-05 11:56:41,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:41,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1396657365, now seen corresponding path program 1 times [2019-04-05 11:56:41,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:41,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:41,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:41,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:41,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:41,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:41,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:41,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:41,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:41,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:41,512 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-05 11:56:41,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:41,513 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-05 11:56:41,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:41,513 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-04-05 11:56:41,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:41,514 INFO L225 Difference]: With dead ends: 49 [2019-04-05 11:56:41,514 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:41,514 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-05 11:56:41,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:41,515 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2019-04-05 11:56:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:41,515 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:41,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:41,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:41,516 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID011_ID007 was SAFE (30/31) [2019-04-05 11:56:41,517 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:41,517 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:41,517 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:41,517 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:41,517 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:41,517 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:41,517 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:41,518 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:41,518 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID011_ID002======== [2019-04-05 11:56:41,518 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-05 11:56:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-04-05 11:56:41,519 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:41,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:41,519 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID011_ID002]=== [2019-04-05 11:56:41,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:41,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1035332497, now seen corresponding path program 1 times [2019-04-05 11:56:41,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:41,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:41,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:41,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:41,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:41,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-05 11:56:41,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:41,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:41,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:41,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:41,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:41,543 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-05 11:56:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:41,546 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-05 11:56:41,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:41,546 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-04-05 11:56:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:41,546 INFO L225 Difference]: With dead ends: 49 [2019-04-05 11:56:41,546 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:41,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-05 11:56:41,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:41,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:41,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:41,550 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-04-05 11:56:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:41,550 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:41,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:41,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:41,551 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID011_ID002 was SAFE (31/31) [2019-04-05 11:56:41,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 11:56:41 BoogieIcfgContainer [2019-04-05 11:56:41,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-04-05 11:56:41,553 INFO L168 Benchmark]: Toolchain (without parser) took 7719.71 ms. Allocated memory was 141.0 MB in the beginning and 234.4 MB in the end (delta: 93.3 MB). Free memory was 108.5 MB in the beginning and 60.6 MB in the end (delta: 48.0 MB). Peak memory consumption was 141.3 MB. Max. memory is 7.1 GB. [2019-04-05 11:56:41,795 INFO L168 Benchmark]: ReqParser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-04-05 11:56:41,796 INFO L168 Benchmark]: PEA to Boogie took 1033.24 ms. Allocated memory was 141.0 MB in the beginning and 175.6 MB in the end (delta: 34.6 MB). Free memory was 108.5 MB in the beginning and 129.5 MB in the end (delta: -21.0 MB). Peak memory consumption was 52.1 MB. Max. memory is 7.1 GB. [2019-04-05 11:56:41,796 INFO L168 Benchmark]: Boogie Printer took 27.05 ms. Allocated memory is still 175.6 MB. Free memory was 129.5 MB in the beginning and 128.7 MB in the end (delta: 797.8 kB). Peak memory consumption was 797.8 kB. Max. memory is 7.1 GB. [2019-04-05 11:56:41,799 INFO L168 Benchmark]: Boogie Preprocessor took 98.76 ms. Allocated memory is still 175.6 MB. Free memory was 128.0 MB in the beginning and 125.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-04-05 11:56:41,800 INFO L168 Benchmark]: RCFGBuilder took 3638.94 ms. Allocated memory was 175.6 MB in the beginning and 235.4 MB in the end (delta: 59.8 MB). Free memory was 125.0 MB in the beginning and 167.0 MB in the end (delta: -42.1 MB). Peak memory consumption was 100.6 MB. Max. memory is 7.1 GB. [2019-04-05 11:56:41,801 INFO L168 Benchmark]: TraceAbstraction took 2917.87 ms. Allocated memory was 235.4 MB in the beginning and 234.4 MB in the end (delta: -1.0 MB). Free memory was 167.0 MB in the beginning and 60.6 MB in the end (delta: 106.5 MB). Peak memory consumption was 105.4 MB. Max. memory is 7.1 GB. [2019-04-05 11:56:41,815 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.20 ms. Allocated memory is still 141.0 MB. Free memory was 110.8 MB in the beginning and 110.6 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 1033.24 ms. Allocated memory was 141.0 MB in the beginning and 175.6 MB in the end (delta: 34.6 MB). Free memory was 108.5 MB in the beginning and 129.5 MB in the end (delta: -21.0 MB). Peak memory consumption was 52.1 MB. Max. memory is 7.1 GB. * Boogie Printer took 27.05 ms. Allocated memory is still 175.6 MB. Free memory was 129.5 MB in the beginning and 128.7 MB in the end (delta: 797.8 kB). Peak memory consumption was 797.8 kB. Max. memory is 7.1 GB. * Boogie Preprocessor took 98.76 ms. Allocated memory is still 175.6 MB. Free memory was 128.0 MB in the beginning and 125.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3638.94 ms. Allocated memory was 175.6 MB in the beginning and 235.4 MB in the end (delta: 59.8 MB). Free memory was 125.0 MB in the beginning and 167.0 MB in the end (delta: -42.1 MB). Peak memory consumption was 100.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2917.87 ms. Allocated memory was 235.4 MB in the beginning and 234.4 MB in the end (delta: -1.0 MB). Free memory was 167.0 MB in the beginning and 60.6 MB in the end (delta: 106.5 MB). Peak memory consumption was 105.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ReqCheckSuccessResult [Line: -1]: Requirements ID009, ID011 are rt-consistent Requirements ID009, ID011 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID009_ID011 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.2s 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 [Line: -1]: Requirements ID001, ID011 are rt-consistent Requirements ID001, ID011 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID001_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, 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]: Requirement ID008 is non-vacuous Requirement ID008 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr29ASSERT_VIOLATIONVACUOUSforID008 CFG has 1 procedures, 65 locations, 31 error locations. UNSAFE Result, 0.4s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 16 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 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 ID002 is non-vacuous Requirement ID002 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr24ASSERT_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, 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 ID002, ID000 are rt-consistent Requirements ID002, ID000 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID002_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, 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 ID007 is non-vacuous Requirement ID007 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr28ASSERT_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, 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 ID009 is non-vacuous Requirement ID009 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr18ASSERT_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, 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]: Requirement ID010 is non-vacuous Requirement ID010 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr26ASSERT_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, 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 ID011, ID005 are rt-consistent Requirements ID011, ID005 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr10ASSERT_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, 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 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.3s 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.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, 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]: Requirements ID009, ID010 are rt-consistent Requirements ID009, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID009_ID010 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: 44 SDtfs, 43 SDslu, 0 SDs, 0 SdLazy, 3 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.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 ID001, ID008 are rt-consistent Requirements ID001, ID008 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID001_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, 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]: Requirement ID006 is non-vacuous Requirement ID006 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr23ASSERT_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, 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 ID001, ID007 are rt-consistent Requirements ID001, ID007 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID001_ID007 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 ID000, ID008 are rt-consistent Requirements ID000, ID008 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID000_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, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID001, ID000 are rt-consistent Requirements ID001, ID000 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_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, 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]: Requirements ID011, ID004 are rt-consistent Requirements ID011, ID004 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr7ASSERT_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, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID005 is non-vacuous Requirement ID005 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr25ASSERT_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, 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]: Requirement ID004 is non-vacuous Requirement ID004 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr22ASSERT_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, 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 ID007, ID008 are rt-consistent Requirements ID007, ID008 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr17ASSERT_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, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [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 ID000 is non-vacuous Requirement ID000 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr27ASSERT_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, 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]: Requirement ID003 is non-vacuous Requirement ID003 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr21ASSERT_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, 24 NumberOfCodeBlocks, 24 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, ID010 are rt-consistent Requirements ID011, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID011_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: 78 SDtfs, 64 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, 19 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 13/13 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: myProcedureErr6ASSERT_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, 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 ID011, ID000 are rt-consistent Requirements ID011, ID000 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr12ASSERT_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, 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]: Requirement ID001 is non-vacuous Requirement ID001 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr19ASSERT_VIOLATIONVACUOUSforID001 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]: Requirements ID011, ID006 are rt-consistent Requirements ID011, ID006 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr8ASSERT_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, 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]: Requirements ID011, ID008 are rt-consistent Requirements ID011, ID008 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID011_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, 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, ID007 are rt-consistent Requirements ID011, ID007 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID011_ID007 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, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID011, ID002 are rt-consistent Requirements ID011, ID002 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr9ASSERT_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, 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...