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/Lambda.reqind_set_3.new.req -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a613b84 [2019-04-05 11:56:21,705 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-04-05 11:56:21,707 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-04-05 11:56:21,725 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-04-05 11:56:21,726 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-04-05 11:56:21,727 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-04-05 11:56:21,729 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-04-05 11:56:21,731 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-04-05 11:56:21,734 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-04-05 11:56:21,742 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-04-05 11:56:21,743 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-04-05 11:56:21,743 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-04-05 11:56:21,745 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-04-05 11:56:21,747 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-04-05 11:56:21,748 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-04-05 11:56:21,751 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-04-05 11:56:21,753 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-04-05 11:56:21,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-04-05 11:56:21,759 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-04-05 11:56:21,763 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-04-05 11:56:21,765 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-04-05 11:56:21,767 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-04-05 11:56:21,772 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-04-05 11:56:21,772 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-04-05 11:56:21,773 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-04-05 11:56:21,774 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-04-05 11:56:21,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-04-05 11:56:21,777 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-04-05 11:56:21,777 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-04-05 11:56:21,778 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-04-05 11:56:21,779 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-04-05 11:56:21,781 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-04-05 11:56:21,782 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-04-05 11:56:21,783 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-04-05 11:56:21,783 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-04-05 11:56:21,784 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-04-05 11:56:21,784 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-04-05 11:56:21,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-04-05 11:56:21,787 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-04-05 11:56:21,787 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/trunk/examples/settings/reqanalyzer/reqanalyzer-nonlin.epf [2019-04-05 11:56:21,803 INFO L110 SettingsManager]: Loading preferences was successful [2019-04-05 11:56:21,803 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-04-05 11:56:21,804 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-04-05 11:56:21,805 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2019-04-05 11:56:21,805 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-04-05 11:56:21,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:12000 [2019-04-05 11:56:21,806 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-04-05 11:56:21,806 INFO L133 SettingsManager]: * Trace refinement exception blacklist=UNKNOWN [2019-04-05 11:56:21,806 INFO L133 SettingsManager]: * Stop after first violation was found=false [2019-04-05 11:56:21,806 INFO L133 SettingsManager]: * Compute statistics for interpolant sequences=false [2019-04-05 11:56:21,806 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM [2019-04-05 11:56:21,806 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-04-05 11:56:21,807 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:21,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-04-05 11:56:21,862 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-04-05 11:56:21,865 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-04-05 11:56:21,867 INFO L271 PluginConnector]: Initializing ReqParser... [2019-04-05 11:56:21,868 INFO L276 PluginConnector]: ReqParser initialized [2019-04-05 11:56:21,868 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/re2019-exp/Lambda.reqind_set_3.new.req [2019-04-05 11:56:21,869 INFO L94 ReqParser]: Parsing file /storage/repos/re2019-exp/Lambda.reqind_set_3.new.req [2019-04-05 11:56:21,917 INFO L134 ReqParser]: 9 requirements (5 non-initialization) in total [2019-04-05 11:56:21,927 WARN L69 ReqParserResultUtil]: The following requirements have been merged because they are equivalent: ID5, ID2 [2019-04-05 11:56:21,929 INFO L134 ReqParser]: 8 requirements (4 non-initialization) after unification [2019-04-05 11:56:21,934 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-04-05 11:56:21,936 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-04-05 11:56:21,936 INFO L113 PluginConnector]: ------------------------PEA to Boogie---------------------------- [2019-04-05 11:56:21,936 INFO L271 PluginConnector]: Initializing PEA to Boogie... [2019-04-05 11:56:21,937 INFO L276 PluginConnector]: PEA to Boogie initialized [2019-04-05 11:56:21,940 INFO L185 PluginConnector]: Executing the observer PEAtoBoogieObserver from plugin PEA to Boogie for "de.uni_freiburg.informatik.ultimate.reqparser OTHER 05.04 11:56:21" (1/1) ... [2019-04-05 11:56:21,952 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:21,967 INFO L59 ReqToPEA]: Transforming 4 requirements to PEAs [2019-04-05 11:56:21,993 INFO L87 ReqToPEA]: Following types of requirements were processed [2019-04-05 11:56:21,994 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.BndResponsePatternUT : 2 [2019-04-05 11:56:21,994 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.BndInvariancePattern : 1 [2019-04-05 11:56:21,994 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.MinDurationPattern : 1 [2019-04-05 11:56:21,994 INFO L92 ReqToPEA]: Finished transforming 4 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:22,130 INFO L154 cyConditionGenerator]: Finished generating primed state invariant of size 1 [2019-04-05 11:56:22,140 INFO L769 Req2BoogieTranslator]: 0 of 4 requirements are invariant [2019-04-05 11:56:22,141 INFO L786 Req2BoogieTranslator]: Computing rt-inconsistency assertions for 6 subsets [2019-04-05 11:56:22,342 INFO L284 cyConditionGenerator]: 6 checks, 2 trivial consistent, 4 non-trivial [2019-04-05 11:56:22,342 INFO L290 cyConditionGenerator]: Of 54 formulas, 0 were quantified, 54 were plain. Needed 30 quantifier elimination runs, 0 quantified solver queries. [2019-04-05 11:56:22,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:22 Unit [2019-04-05 11:56:22,356 INFO L132 PluginConnector]: ------------------------ END PEA to Boogie---------------------------- [2019-04-05 11:56:22,357 INFO L113 PluginConnector]: ------------------------Boogie Printer---------------------------- [2019-04-05 11:56:22,357 INFO L271 PluginConnector]: Initializing Boogie Printer... [2019-04-05 11:56:22,357 INFO L276 PluginConnector]: Boogie Printer initialized [2019-04-05 11:56:22,358 INFO L185 PluginConnector]: Executing the observer BoogiePrinterObserver from plugin Boogie Printer for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:22" (1/1) ... [2019-04-05 11:56:22,358 INFO L116 oogiePrinterObserver]: File already exists and will be overwritten: /tmp/boogiePrinter.bpl [2019-04-05 11:56:22,358 INFO L120 oogiePrinterObserver]: Writing to file /tmp/boogiePrinter.bpl [2019-04-05 11:56:22,364 INFO L132 PluginConnector]: ------------------------ END Boogie Printer---------------------------- [2019-04-05 11:56:22,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-04-05 11:56:22,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-04-05 11:56:22,365 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-04-05 11:56:22,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:22" (1/1) ... [2019-04-05 11:56:22,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:22" (1/1) ... [2019-04-05 11:56:22,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:22" (1/1) ... [2019-04-05 11:56:22,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:22" (1/1) ... [2019-04-05 11:56:22,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:22" (1/1) ... [2019-04-05 11:56:22,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:22" (1/1) ... [2019-04-05 11:56:22,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:22" (1/1) ... [2019-04-05 11:56:22,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-04-05 11:56:22,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-04-05 11:56:22,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-04-05 11:56:22,411 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-04-05 11:56:22,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-04-05 11:56:22,430 INFO L124 BoogieDeclarations]: Specification and implementation of procedure myProcedure given in one single declaration [2019-04-05 11:56:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure myProcedure [2019-04-05 11:56:22,431 INFO L138 BoogieDeclarations]: Found implementation of procedure myProcedure Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:12000 [2019-04-05 11:56:24,211 INFO L278 CfgBuilder]: Using library mode [2019-04-05 11:56:24,211 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-04-05 11:56:24,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 11:56:24 BoogieIcfgContainer [2019-04-05 11:56:24,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-04-05 11:56:24,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-04-05 11:56:24,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-04-05 11:56:24,218 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-04-05 11:56:24,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.reqparser OTHER 05.04 11:56:21" (1/3) ... [2019-04-05 11:56:24,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495c6c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 05.04 11:56:24, skipping insertion in model container [2019-04-05 11:56:24,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:22" (2/3) ... [2019-04-05 11:56:24,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495c6c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 11:56:24, skipping insertion in model container [2019-04-05 11:56:24,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 11:56:24" (3/3) ... [2019-04-05 11:56:24,222 INFO L112 eAbstractionObserver]: Analyzing ICFG [2019-04-05 11:56:24,233 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-04-05 11:56:24,239 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-04-05 11:56:24,260 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:24,290 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:24,290 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:24,290 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:24,290 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:24,292 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:24,292 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:24,292 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:24,293 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID4_ID2======== [2019-04-05 11:56:24,314 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-04-05 11:56:24,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-04-05 11:56:24,328 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:24,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-04-05 11:56:24,330 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID4_ID2]=== [2019-04-05 11:56:24,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:24,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1231363382, now seen corresponding path program 1 times [2019-04-05 11:56:24,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:24,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:24,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:24,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:24,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:24,513 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:24,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:24,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:24,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:24,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:24,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:24,543 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-04-05 11:56:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:24,568 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-04-05 11:56:24,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:24,570 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-04-05 11:56:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:24,586 INFO L225 Difference]: With dead ends: 18 [2019-04-05 11:56:24,586 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:24,590 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:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:24,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:24,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:24,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:24,612 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-04-05 11:56:24,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:24,612 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:24,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:24,613 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:24,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:24,616 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID4_ID2 was SAFE (1/9) [2019-04-05 11:56:24,618 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:24,619 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:24,619 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:24,619 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:24,619 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:24,619 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:24,619 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:24,620 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:24,620 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr8ASSERT_VIOLATIONCONSISTENCYforallrequirements======== [2019-04-05 11:56:24,621 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-04-05 11:56:24,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-04-05 11:56:24,622 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:24,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:24,623 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr8ASSERT_VIOLATIONCONSISTENCYforallrequirements]=== [2019-04-05 11:56:24,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:24,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1399827846, now seen corresponding path program 1 times [2019-04-05 11:56:24,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:24,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:24,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:24,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:24,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:24,645 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:24,650 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr8ASSERT_VIOLATIONCONSISTENCYforallrequirements was UNSAFE (2/9) [2019-04-05 11:56:24,651 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:24,651 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:24,651 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:24,652 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:24,652 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:24,652 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:24,652 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:24,652 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:24,652 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID1_ID3======== [2019-04-05 11:56:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-04-05 11:56:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-04-05 11:56:24,654 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:24,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-04-05 11:56:24,655 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID1_ID3]=== [2019-04-05 11:56:24,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:24,655 INFO L82 PathProgramCache]: Analyzing trace with hash 41330, now seen corresponding path program 1 times [2019-04-05 11:56:24,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:24,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:24,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:24,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:24,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:24,673 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:24,675 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID1_ID3 was UNSAFE (3/9) [2019-04-05 11:56:24,676 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:24,676 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:24,676 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:24,676 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:24,676 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:24,676 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:24,677 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:24,677 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:24,677 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID1_ID4======== [2019-04-05 11:56:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-04-05 11:56:24,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-04-05 11:56:24,679 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:24,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-04-05 11:56:24,679 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID1_ID4]=== [2019-04-05 11:56:24,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:24,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1281332, now seen corresponding path program 1 times [2019-04-05 11:56:24,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:24,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:24,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:24,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:24,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:24,704 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:24,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:24,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:24,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:24,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:24,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:24,705 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-04-05 11:56:24,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:24,707 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-04-05 11:56:24,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:24,708 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-04-05 11:56:24,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:24,708 INFO L225 Difference]: With dead ends: 18 [2019-04-05 11:56:24,708 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:24,709 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:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:24,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:24,710 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-04-05 11:56:24,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:24,710 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:24,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:24,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:24,711 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID1_ID4 was SAFE (4/9) [2019-04-05 11:56:24,712 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:24,713 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:24,713 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:24,713 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:24,713 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:24,713 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:24,713 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:24,713 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:24,714 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr5ASSERT_VIOLATIONVACUOUSforID3======== [2019-04-05 11:56:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-04-05 11:56:24,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-04-05 11:56:24,716 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:24,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:24,716 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr5ASSERT_VIOLATIONVACUOUSforID3]=== [2019-04-05 11:56:24,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:24,717 INFO L82 PathProgramCache]: Analyzing trace with hash -2070760136, now seen corresponding path program 1 times [2019-04-05 11:56:24,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:24,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:24,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:24,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:24,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:24,731 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:24,732 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr5ASSERT_VIOLATIONVACUOUSforID3 was UNSAFE (5/9) [2019-04-05 11:56:24,733 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:24,733 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:24,734 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:24,734 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:24,734 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:24,734 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:24,734 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:24,734 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:24,734 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr6ASSERT_VIOLATIONVACUOUSforID4======== [2019-04-05 11:56:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-04-05 11:56:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-04-05 11:56:24,736 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:24,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:24,737 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr6ASSERT_VIOLATIONVACUOUSforID4]=== [2019-04-05 11:56:24,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash 230945336, now seen corresponding path program 1 times [2019-04-05 11:56:24,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:24,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:24,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:24,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:24,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:24,902 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:24,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:24,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:24,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-05 11:56:24,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-05 11:56:24,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 11:56:24,906 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-04-05 11:56:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:24,988 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-04-05 11:56:24,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 11:56:24,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-04-05 11:56:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:24,992 INFO L225 Difference]: With dead ends: 34 [2019-04-05 11:56:24,992 INFO L226 Difference]: Without dead ends: 22 [2019-04-05 11:56:24,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 11:56:24,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-04-05 11:56:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-04-05 11:56:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-04-05 11:56:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-04-05 11:56:25,002 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 9 [2019-04-05 11:56:25,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:25,003 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-04-05 11:56:25,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-05 11:56:25,003 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-04-05 11:56:25,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-04-05 11:56:25,004 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:25,004 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-04-05 11:56:25,005 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr6ASSERT_VIOLATIONVACUOUSforID4]=== [2019-04-05 11:56:25,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:25,005 INFO L82 PathProgramCache]: Analyzing trace with hash -863615831, now seen corresponding path program 1 times [2019-04-05 11:56:25,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:25,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:25,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:25,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:25,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:25,044 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:25,046 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr6ASSERT_VIOLATIONVACUOUSforID4 was UNSAFE (6/9) [2019-04-05 11:56:25,047 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:25,048 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:25,048 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:25,048 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:25,048 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:25,048 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:25,049 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:25,049 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:25,049 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr4ASSERT_VIOLATIONVACUOUSforID1======== [2019-04-05 11:56:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-04-05 11:56:25,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-04-05 11:56:25,051 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:25,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:25,051 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr4ASSERT_VIOLATIONVACUOUSforID1]=== [2019-04-05 11:56:25,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:25,052 INFO L82 PathProgramCache]: Analyzing trace with hash -482440714, now seen corresponding path program 1 times [2019-04-05 11:56:25,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:25,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:25,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:25,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:25,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:25,077 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:25,078 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr4ASSERT_VIOLATIONVACUOUSforID1 was UNSAFE (7/9) [2019-04-05 11:56:25,078 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:25,079 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:25,079 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:25,079 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:25,079 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:25,080 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:25,081 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:25,081 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:25,082 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr7ASSERT_VIOLATIONVACUOUSforID2======== [2019-04-05 11:56:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-04-05 11:56:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-04-05 11:56:25,084 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:25,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:25,086 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr7ASSERT_VIOLATIONVACUOUSforID2]=== [2019-04-05 11:56:25,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:25,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1430629062, now seen corresponding path program 1 times [2019-04-05 11:56:25,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:25,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:25,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:25,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:25,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:25,214 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:25,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:25,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 11:56:25,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-05 11:56:25,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-05 11:56:25,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-05 11:56:25,218 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 4 states. [2019-04-05 11:56:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:25,403 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-04-05 11:56:25,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-05 11:56:25,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-04-05 11:56:25,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:25,405 INFO L225 Difference]: With dead ends: 34 [2019-04-05 11:56:25,406 INFO L226 Difference]: Without dead ends: 22 [2019-04-05 11:56:25,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-05 11:56:25,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-04-05 11:56:25,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-04-05 11:56:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-04-05 11:56:25,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-04-05 11:56:25,410 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 10 [2019-04-05 11:56:25,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:25,410 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-04-05 11:56:25,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-05 11:56:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-04-05 11:56:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-04-05 11:56:25,411 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:25,412 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-04-05 11:56:25,412 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr7ASSERT_VIOLATIONVACUOUSforID2]=== [2019-04-05 11:56:25,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:25,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1002286871, now seen corresponding path program 1 times [2019-04-05 11:56:25,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:25,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:25,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:25,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:25,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:25,661 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-04-05 11:56:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:25,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-05 11:56:25,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-05 11:56:25,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:25,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2019-04-05 11:56:25,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-05 11:56:26,366 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-04-05 11:56:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:26,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-05 11:56:26,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-04-05 11:56:26,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-04-05 11:56:26,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-04-05 11:56:26,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-04-05 11:56:26,457 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states. [2019-04-05 11:56:26,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:26,540 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-04-05 11:56:26,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-05 11:56:26,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-04-05 11:56:26,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:26,541 INFO L225 Difference]: With dead ends: 21 [2019-04-05 11:56:26,542 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:26,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-04-05 11:56:26,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:26,544 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-04-05 11:56:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:26,544 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:26,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-04-05 11:56:26,544 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:26,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:26,545 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr7ASSERT_VIOLATIONVACUOUSforID2 was SAFE (8/9) [2019-04-05 11:56:26,546 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:26,547 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:26,547 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:26,547 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:26,547 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:26,547 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:26,547 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:26,547 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:26,548 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID3_ID4======== [2019-04-05 11:56:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-04-05 11:56:26,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-04-05 11:56:26,549 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:26,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-04-05 11:56:26,550 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID3_ID4]=== [2019-04-05 11:56:26,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:26,550 INFO L82 PathProgramCache]: Analyzing trace with hash 39721396, now seen corresponding path program 1 times [2019-04-05 11:56:26,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:26,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:26,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:26,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:26,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:26,577 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:26,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:26,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:26,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:26,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:26,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:26,579 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-04-05 11:56:26,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:26,580 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-04-05 11:56:26,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:26,585 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-04-05 11:56:26,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:26,585 INFO L225 Difference]: With dead ends: 18 [2019-04-05 11:56:26,586 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:26,586 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:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:26,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:26,591 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-04-05 11:56:26,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:26,591 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:26,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:26,592 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:26,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:26,593 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID3_ID4 was SAFE (9/9) [2019-04-05 11:56:26,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 11:56:26 BoogieIcfgContainer [2019-04-05 11:56:26,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-04-05 11:56:26,595 INFO L168 Benchmark]: Toolchain (without parser) took 4659.84 ms. Allocated memory was 132.6 MB in the beginning and 195.6 MB in the end (delta: 62.9 MB). Free memory was 108.1 MB in the beginning and 122.4 MB in the end (delta: -14.4 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. [2019-04-05 11:56:26,598 INFO L168 Benchmark]: ReqParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-04-05 11:56:26,600 INFO L168 Benchmark]: PEA to Boogie took 420.20 ms. Allocated memory is still 132.6 MB. Free memory was 108.1 MB in the beginning and 89.0 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2019-04-05 11:56:26,601 INFO L168 Benchmark]: Boogie Printer took 7.51 ms. Allocated memory is still 132.6 MB. Free memory was 89.0 MB in the beginning and 88.3 MB in the end (delta: 641.4 kB). Peak memory consumption was 641.4 kB. Max. memory is 7.1 GB. [2019-04-05 11:56:26,601 INFO L168 Benchmark]: Boogie Preprocessor took 45.51 ms. Allocated memory is still 132.6 MB. Free memory was 88.3 MB in the beginning and 86.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-04-05 11:56:26,602 INFO L168 Benchmark]: RCFGBuilder took 1802.41 ms. Allocated memory was 132.6 MB in the beginning and 171.4 MB in the end (delta: 38.8 MB). Free memory was 86.0 MB in the beginning and 111.6 MB in the end (delta: -25.6 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2019-04-05 11:56:26,603 INFO L168 Benchmark]: TraceAbstraction took 2380.02 ms. Allocated memory was 171.4 MB in the beginning and 195.6 MB in the end (delta: 24.1 MB). Free memory was 111.6 MB in the beginning and 122.4 MB in the end (delta: -10.8 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2019-04-05 11:56:26,608 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * ReqParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * PEA to Boogie took 420.20 ms. Allocated memory is still 132.6 MB. Free memory was 108.1 MB in the beginning and 89.0 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Printer took 7.51 ms. Allocated memory is still 132.6 MB. Free memory was 89.0 MB in the beginning and 88.3 MB in the end (delta: 641.4 kB). Peak memory consumption was 641.4 kB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.51 ms. Allocated memory is still 132.6 MB. Free memory was 88.3 MB in the beginning and 86.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1802.41 ms. Allocated memory was 132.6 MB in the beginning and 171.4 MB in the end (delta: 38.8 MB). Free memory was 86.0 MB in the beginning and 111.6 MB in the end (delta: -25.6 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2380.02 ms. Allocated memory was 171.4 MB in the beginning and 195.6 MB in the end (delta: 24.1 MB). Free memory was 111.6 MB in the beginning and 122.4 MB in the end (delta: -10.8 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ReqCheckSuccessResult [Line: -1]: Requirements ID4, ID2 are rt-consistent Requirements ID4, ID2 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID4_ID2 CFG has 1 procedures, 21 locations, 9 error locations. SAFE Result, 0.3s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 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=21occurred 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 [UNKNOWN] : All requirements are consistent All requirements are consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr8ASSERT_VIOLATIONCONSISTENCYforallrequirements CFG has 1 procedures, 21 locations, 9 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=21occurred 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, 11 NumberOfCodeBlocks, 11 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 - ReqCheckFailResult [Line: -1]: Requirements ID1, ID3 are rt-inconsistent Requirements ID1, ID3 are rt-inconsistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID1_ID3 CFG has 1 procedures, 21 locations, 9 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=21occurred 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, 3 NumberOfCodeBlocks, 3 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 ID1, ID4 are rt-consistent Requirements ID1, ID4 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID1_ID4 CFG has 1 procedures, 21 locations, 9 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 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=21occurred 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]: Requirement ID3 is non-vacuous Requirement ID3 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr5ASSERT_VIOLATIONVACUOUSforID3 CFG has 1 procedures, 21 locations, 9 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=21occurred 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, 8 NumberOfCodeBlocks, 8 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 ID4 is non-vacuous Requirement ID4 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr6ASSERT_VIOLATIONVACUOUSforID4 CFG has 1 procedures, 21 locations, 9 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16 SDtfs, 8 SDslu, 14 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.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 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 ID1 is non-vacuous Requirement ID1 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr4ASSERT_VIOLATIONVACUOUSforID1 CFG has 1 procedures, 21 locations, 9 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=21occurred 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, 7 NumberOfCodeBlocks, 7 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 - ReqCheckFailResult [Line: -1]: Requirement ID2 is vacuous Requirement ID2 is vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr7ASSERT_VIOLATIONVACUOUSforID2 CFG has 1 procedures, 21 locations, 9 error locations. SAFE Result, 1.4s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 SDtfs, 50 SDslu, 34 SDs, 0 SdLazy, 20 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 13 NumberOfNonLiveVariables, 64 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/18 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID3, ID4 are rt-consistent Requirements ID3, ID4 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID3_ID4 CFG has 1 procedures, 21 locations, 9 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 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=21occurred 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 * Results from de.uni_freiburg.informatik.ultimate.reqparser: - MergedRequirementsResult: Merged ID5, ID2 The following requirements have been merged because they are equivalent: ID5, ID2 RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...