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/exampleDeadlock2.new.req -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a613b84 [2019-04-05 11:56:32,353 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-04-05 11:56:32,355 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-04-05 11:56:32,366 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-04-05 11:56:32,366 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-04-05 11:56:32,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-04-05 11:56:32,369 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-04-05 11:56:32,371 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-04-05 11:56:32,373 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-04-05 11:56:32,373 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-04-05 11:56:32,375 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-04-05 11:56:32,375 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-04-05 11:56:32,376 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-04-05 11:56:32,377 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-04-05 11:56:32,378 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-04-05 11:56:32,379 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-04-05 11:56:32,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-04-05 11:56:32,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-04-05 11:56:32,384 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-04-05 11:56:32,386 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-04-05 11:56:32,387 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-04-05 11:56:32,388 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-04-05 11:56:32,391 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-04-05 11:56:32,391 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-04-05 11:56:32,391 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-04-05 11:56:32,392 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-04-05 11:56:32,393 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-04-05 11:56:32,394 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-04-05 11:56:32,394 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-04-05 11:56:32,395 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-04-05 11:56:32,396 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-04-05 11:56:32,397 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-04-05 11:56:32,398 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-04-05 11:56:32,398 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-04-05 11:56:32,399 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-04-05 11:56:32,399 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-04-05 11:56:32,399 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-04-05 11:56:32,400 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-04-05 11:56:32,401 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-04-05 11:56:32,402 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/trunk/examples/settings/reqanalyzer/reqanalyzer-nonlin.epf [2019-04-05 11:56:32,410 INFO L110 SettingsManager]: Loading preferences was successful [2019-04-05 11:56:32,411 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-04-05 11:56:32,412 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-04-05 11:56:32,412 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2019-04-05 11:56:32,412 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-04-05 11:56:32,413 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:12000 [2019-04-05 11:56:32,413 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-04-05 11:56:32,413 INFO L133 SettingsManager]: * Trace refinement exception blacklist=UNKNOWN [2019-04-05 11:56:32,413 INFO L133 SettingsManager]: * Stop after first violation was found=false [2019-04-05 11:56:32,414 INFO L133 SettingsManager]: * Compute statistics for interpolant sequences=false [2019-04-05 11:56:32,414 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM [2019-04-05 11:56:32,414 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-04-05 11:56:32,414 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:32,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-04-05 11:56:32,471 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-04-05 11:56:32,474 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-04-05 11:56:32,476 INFO L271 PluginConnector]: Initializing ReqParser... [2019-04-05 11:56:32,477 INFO L276 PluginConnector]: ReqParser initialized [2019-04-05 11:56:32,478 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/re2019-exp/exampleDeadlock2.new.req [2019-04-05 11:56:32,478 INFO L94 ReqParser]: Parsing file /storage/repos/re2019-exp/exampleDeadlock2.new.req [2019-04-05 11:56:32,526 INFO L134 ReqParser]: 8 requirements (5 non-initialization) in total [2019-04-05 11:56:32,530 INFO L134 ReqParser]: 8 requirements (5 non-initialization) after unification [2019-04-05 11:56:32,537 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-04-05 11:56:32,539 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-04-05 11:56:32,540 INFO L113 PluginConnector]: ------------------------PEA to Boogie---------------------------- [2019-04-05 11:56:32,540 INFO L271 PluginConnector]: Initializing PEA to Boogie... [2019-04-05 11:56:32,540 INFO L276 PluginConnector]: PEA to Boogie initialized [2019-04-05 11:56:32,543 INFO L185 PluginConnector]: Executing the observer PEAtoBoogieObserver from plugin PEA to Boogie for "de.uni_freiburg.informatik.ultimate.reqparser OTHER 05.04 11:56:32" (1/1) ... [2019-04-05 11:56:32,553 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:32,566 INFO L59 ReqToPEA]: Transforming 5 requirements to PEAs [2019-04-05 11:56:32,586 INFO L87 ReqToPEA]: Following types of requirements were processed [2019-04-05 11:56:32,587 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.InstAbsPattern : 1 [2019-04-05 11:56:32,587 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.MaxDurationPattern : 1 [2019-04-05 11:56:32,587 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.MinDurationPattern : 1 [2019-04-05 11:56:32,587 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.BndResponsePatternUT : 2 [2019-04-05 11:56:32,587 INFO L92 ReqToPEA]: Finished transforming 5 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:32,854 INFO L154 cyConditionGenerator]: Finished generating primed state invariant of size 5 [2019-04-05 11:56:32,865 INFO L769 Req2BoogieTranslator]: 1 of 5 requirements are invariant [2019-04-05 11:56:32,866 INFO L786 Req2BoogieTranslator]: Computing rt-inconsistency assertions for 6 subsets [2019-04-05 11:56:33,066 INFO L284 cyConditionGenerator]: 6 checks, 2 trivial consistent, 4 non-trivial [2019-04-05 11:56:33,067 INFO L290 cyConditionGenerator]: Of 45 formulas, 0 were quantified, 45 were plain. Needed 20 quantifier elimination runs, 0 quantified solver queries. [2019-04-05 11:56:33,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:33 Unit [2019-04-05 11:56:33,080 INFO L132 PluginConnector]: ------------------------ END PEA to Boogie---------------------------- [2019-04-05 11:56:33,086 INFO L113 PluginConnector]: ------------------------Boogie Printer---------------------------- [2019-04-05 11:56:33,086 INFO L271 PluginConnector]: Initializing Boogie Printer... [2019-04-05 11:56:33,086 INFO L276 PluginConnector]: Boogie Printer initialized [2019-04-05 11:56:33,088 INFO L185 PluginConnector]: Executing the observer BoogiePrinterObserver from plugin Boogie Printer for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:33" (1/1) ... [2019-04-05 11:56:33,089 INFO L116 oogiePrinterObserver]: File already exists and will be overwritten: /tmp/boogiePrinter.bpl [2019-04-05 11:56:33,089 INFO L120 oogiePrinterObserver]: Writing to file /tmp/boogiePrinter.bpl [2019-04-05 11:56:33,096 INFO L132 PluginConnector]: ------------------------ END Boogie Printer---------------------------- [2019-04-05 11:56:33,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-04-05 11:56:33,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-04-05 11:56:33,097 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-04-05 11:56:33,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:33" (1/1) ... [2019-04-05 11:56:33,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:33" (1/1) ... [2019-04-05 11:56:33,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:33" (1/1) ... [2019-04-05 11:56:33,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:33" (1/1) ... [2019-04-05 11:56:33,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:33" (1/1) ... [2019-04-05 11:56:33,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:33" (1/1) ... [2019-04-05 11:56:33,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:33" (1/1) ... [2019-04-05 11:56:33,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-04-05 11:56:33,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-04-05 11:56:33,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-04-05 11:56:33,158 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-04-05 11:56:33,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:33" (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:33,175 INFO L124 BoogieDeclarations]: Specification and implementation of procedure myProcedure given in one single declaration [2019-04-05 11:56:33,175 INFO L130 BoogieDeclarations]: Found specification of procedure myProcedure [2019-04-05 11:56:33,175 INFO L138 BoogieDeclarations]: Found implementation of procedure myProcedure [2019-04-05 11:56:34,784 INFO L278 CfgBuilder]: Using library mode [2019-04-05 11:56:34,784 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-04-05 11:56:34,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 11:56:34 BoogieIcfgContainer [2019-04-05 11:56:34,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-04-05 11:56:34,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-04-05 11:56:34,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-04-05 11:56:34,791 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-04-05 11:56:34,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.reqparser OTHER 05.04 11:56:32" (1/3) ... [2019-04-05 11:56:34,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472b8dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 05.04 11:56:34, skipping insertion in model container [2019-04-05 11:56:34,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:33" (2/3) ... [2019-04-05 11:56:34,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472b8dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 11:56:34, skipping insertion in model container [2019-04-05 11:56:34,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 11:56:34" (3/3) ... [2019-04-05 11:56:34,795 INFO L112 eAbstractionObserver]: Analyzing ICFG [2019-04-05 11:56:34,805 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-04-05 11:56:34,811 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-04-05 11:56:34,831 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:34,859 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:34,860 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:34,860 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:34,860 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:34,861 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:34,861 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:34,861 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:34,861 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_ID002======== [2019-04-05 11:56:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-04-05 11:56:34,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-04-05 11:56:34,886 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:34,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-04-05 11:56:34,887 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_ID002]=== [2019-04-05 11:56:34,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:34,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1223082477, now seen corresponding path program 1 times [2019-04-05 11:56:34,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:34,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:34,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:34,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:34,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:35,327 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-04-05 11:56:35,470 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:35,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:35,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 11:56:35,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-05 11:56:35,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-05 11:56:35,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-05 11:56:35,495 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 4 states. [2019-04-05 11:56:35,683 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-04-05 11:56:35,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:35,782 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-04-05 11:56:35,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 11:56:35,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-04-05 11:56:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:35,794 INFO L225 Difference]: With dead ends: 34 [2019-04-05 11:56:35,794 INFO L226 Difference]: Without dead ends: 22 [2019-04-05 11:56:35,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-05 11:56:35,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-04-05 11:56:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2019-04-05 11:56:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-04-05 11:56:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-04-05 11:56:35,829 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 6 [2019-04-05 11:56:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:35,830 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-04-05 11:56:35,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-05 11:56:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-04-05 11:56:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-04-05 11:56:35,831 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:35,831 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:35,831 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_ID002]=== [2019-04-05 11:56:35,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:35,832 INFO L82 PathProgramCache]: Analyzing trace with hash -995067406, now seen corresponding path program 1 times [2019-04-05 11:56:35,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:35,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:35,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:35,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:36,231 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-04-05 11:56:36,443 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 15 [2019-04-05 11:56:36,677 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 24 [2019-04-05 11:56:37,043 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 24 [2019-04-05 11:56:37,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:37,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-05 11:56:37,044 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:37,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:37,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 29 conjunts are in the unsatisfiable core [2019-04-05 11:56:37,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-05 11:56:38,341 WARN L188 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2019-04-05 11:56:38,693 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-04-05 11:56:45,269 WARN L188 SmtUtils]: Spent 5.26 s on a formula simplification. DAG size of input: 157 DAG size of output: 123 [2019-04-05 11:56:56,960 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2019-04-05 11:56:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:56,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-05 11:56:56,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-04-05 11:56:56,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-04-05 11:56:56,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-04-05 11:56:56,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-04-05 11:56:56,985 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-04-05 11:56:57,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:57,061 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-04-05 11:56:57,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-05 11:56:57,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-04-05 11:56:57,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:57,063 INFO L225 Difference]: With dead ends: 32 [2019-04-05 11:56:57,063 INFO L226 Difference]: Without dead ends: 32 [2019-04-05 11:56:57,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-04-05 11:56:57,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-04-05 11:56:57,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2019-04-05 11:56:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-04-05 11:56:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-04-05 11:56:57,070 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 16 [2019-04-05 11:56:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:57,071 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-04-05 11:56:57,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-04-05 11:56:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-04-05 11:56:57,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-04-05 11:56:57,072 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:57,072 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1] [2019-04-05 11:56:57,072 INFO L423 AbstractCegarLoop]: === Iteration 3 === [myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_ID002]=== [2019-04-05 11:56:57,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:57,073 INFO L82 PathProgramCache]: Analyzing trace with hash 573288375, now seen corresponding path program 2 times [2019-04-05 11:56:57,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:57,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:57,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:57,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:57,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:57,652 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2019-04-05 11:56:57,775 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 30 [2019-04-05 11:56:57,917 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2019-04-05 11:56:58,042 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2019-04-05 11:56:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:58,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-05 11:56:58,044 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-05 11:56:58,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:58,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 40 conjunts are in the unsatisfiable core [2019-04-05 11:56:58,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-05 11:56:58,501 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 37 [2019-04-05 11:56:58,541 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-04-05 11:57:00,207 WARN L188 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-04-05 11:57:01,020 WARN L188 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 39 [2019-04-05 11:57:01,600 WARN L188 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-04-05 11:57:04,176 WARN L188 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 36 [2019-04-05 11:57:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:57:04,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-05 11:57:04,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-04-05 11:57:04,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-04-05 11:57:04,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-04-05 11:57:04,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-04-05 11:57:04,200 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2019-04-05 11:57:04,342 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 28 [2019-04-05 11:57:04,482 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-04-05 11:57:04,959 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-04-05 11:57:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:57:05,000 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-04-05 11:57:05,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-04-05 11:57:05,001 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-04-05 11:57:05,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:57:05,002 INFO L225 Difference]: With dead ends: 42 [2019-04-05 11:57:05,002 INFO L226 Difference]: Without dead ends: 42 [2019-04-05 11:57:05,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-04-05 11:57:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-04-05 11:57:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2019-04-05 11:57:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-04-05 11:57:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-04-05 11:57:05,007 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 26 [2019-04-05 11:57:05,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:57:05,008 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-04-05 11:57:05,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-04-05 11:57:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-04-05 11:57:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-04-05 11:57:05,009 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:57:05,009 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1] [2019-04-05 11:57:05,010 INFO L423 AbstractCegarLoop]: === Iteration 4 === [myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_ID002]=== [2019-04-05 11:57:05,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:57:05,010 INFO L82 PathProgramCache]: Analyzing trace with hash 249967420, now seen corresponding path program 3 times [2019-04-05 11:57:05,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:57:05,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:57:05,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:57:05,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:57:05,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:57:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:57:06,043 WARN L188 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-04-05 11:57:06,220 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-04-05 11:57:06,802 WARN L188 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 83 [2019-04-05 11:57:07,282 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 63 [2019-04-05 11:57:07,888 WARN L188 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 63 [2019-04-05 11:57:08,307 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 59 [2019-04-05 11:57:08,637 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-04-05 11:57:08,769 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 28 [2019-04-05 11:57:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:57:08,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-05 11:57:08,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-05 11:57:08,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:57:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:57:08,819 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 73 conjunts are in the unsatisfiable core [2019-04-05 11:57:08,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-05 11:57:09,405 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 42 [2019-04-05 11:57:09,857 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-04-05 11:57:09,909 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 12960 conjuctions. This might take some time... [2019-04-05 11:57:26,645 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 12960 conjuctions. [2019-04-05 11:57:26,873 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-04-05 11:57:26,928 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 12960 conjuctions. This might take some time... [2019-04-05 11:57:47,227 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 12960 conjuctions. [2019-04-05 11:57:53,960 WARN L188 SmtUtils]: Spent 5.31 s on a formula simplification. DAG size of input: 210 DAG size of output: 118 [2019-04-05 11:57:58,258 WARN L188 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 51 [2019-04-05 11:58:29,919 WARN L188 SmtUtils]: Spent 26.70 s on a formula simplification. DAG size of input: 626 DAG size of output: 202 [2019-04-05 11:59:51,933 WARN L188 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 253 DAG size of output: 71 [2019-04-05 12:00:21,352 WARN L188 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 313 DAG size of output: 160 [2019-04-05 12:01:34,813 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-04-05 12:01:35,014 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-05 12:01:35,015 WARN L549 AbstractCegarLoop]: Verification canceled [2019-04-05 12:01:35,020 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_ID002 was TIMEOUT (1/9) [2019-04-05 12:01:35,022 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:35,022 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:35,022 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:35,023 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:35,023 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:35,023 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:35,023 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:35,023 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:35,023 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr6ASSERT_VIOLATIONVACUOUSforID004======== [2019-04-05 12:01:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-04-05 12:01:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-04-05 12:01:35,026 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:35,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:35,026 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr6ASSERT_VIOLATIONVACUOUSforID004]=== [2019-04-05 12:01:35,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:35,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1652358654, now seen corresponding path program 1 times [2019-04-05 12:01:35,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:35,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:35,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:35,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:35,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 12:01:35,034 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 12:01:35,039 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr6ASSERT_VIOLATIONVACUOUSforID004 was UNSAFE (2/9) [2019-04-05 12:01:35,040 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:35,040 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:35,040 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:35,040 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:35,040 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:35,041 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:35,041 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:35,041 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:35,041 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr7ASSERT_VIOLATIONVACUOUSforID002======== [2019-04-05 12:01:35,042 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-04-05 12:01:35,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-04-05 12:01:35,042 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:35,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:35,043 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr7ASSERT_VIOLATIONVACUOUSforID002]=== [2019-04-05 12:01:35,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:35,043 INFO L82 PathProgramCache]: Analyzing trace with hash 316489393, now seen corresponding path program 1 times [2019-04-05 12:01:35,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:35,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:35,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:35,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:35,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 12:01:35,048 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 12:01:35,048 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr7ASSERT_VIOLATIONVACUOUSforID002 was UNSAFE (3/9) [2019-04-05 12:01:35,049 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:35,049 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:35,049 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:35,049 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:35,050 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:35,050 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:35,050 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:35,050 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:35,050 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID003_ID002======== [2019-04-05 12:01:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-04-05 12:01:35,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-04-05 12:01:35,051 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:35,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-04-05 12:01:35,052 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID003_ID002]=== [2019-04-05 12:01:35,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:35,052 INFO L82 PathProgramCache]: Analyzing trace with hash 39454270, now seen corresponding path program 1 times [2019-04-05 12:01:35,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:35,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:35,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:35,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:35,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:35,131 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 12:01:35,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:35,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:35,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 12:01:35,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 12:01:35,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:35,132 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-04-05 12:01:35,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:35,133 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-04-05 12:01:35,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 12:01:35,135 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-04-05 12:01:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:35,135 INFO L225 Difference]: With dead ends: 18 [2019-04-05 12:01:35,135 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:35,135 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 12:01:35,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:35,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:35,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:35,136 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-04-05 12:01:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:35,136 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:35,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 12:01:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:35,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:35,139 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID003_ID002 was SAFE (4/9) [2019-04-05 12:01:35,140 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:35,140 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:35,140 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:35,140 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:35,140 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:35,140 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:35,140 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:35,141 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:35,141 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID003_ID004======== [2019-04-05 12:01:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-04-05 12:01:35,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-04-05 12:01:35,144 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:35,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-04-05 12:01:35,144 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID003_ID004]=== [2019-04-05 12:01:35,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:35,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1272715, now seen corresponding path program 1 times [2019-04-05 12:01:35,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:35,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:35,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:35,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:35,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:35,152 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 12:01:35,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:35,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:35,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 12:01:35,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 12:01:35,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:35,154 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-04-05 12:01:35,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:35,155 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-04-05 12:01:35,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 12:01:35,156 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-04-05 12:01:35,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:35,156 INFO L225 Difference]: With dead ends: 18 [2019-04-05 12:01:35,156 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:35,156 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 12:01:35,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:35,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:35,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:35,157 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-04-05 12:01:35,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:35,158 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:35,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 12:01:35,158 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:35,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:35,158 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID003_ID004 was SAFE (5/9) [2019-04-05 12:01:35,159 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:35,159 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:35,159 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:35,160 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:35,160 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:35,160 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:35,160 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:35,160 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:35,160 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr5ASSERT_VIOLATIONVACUOUSforID001======== [2019-04-05 12:01:35,161 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-04-05 12:01:35,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-04-05 12:01:35,162 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:35,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:35,162 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr5ASSERT_VIOLATIONVACUOUSforID001]=== [2019-04-05 12:01:35,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:35,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1438775217, now seen corresponding path program 1 times [2019-04-05 12:01:35,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:35,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:35,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:35,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:35,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 12:01:35,167 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 12:01:35,168 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr5ASSERT_VIOLATIONVACUOUSforID001 was UNSAFE (6/9) [2019-04-05 12:01:35,169 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:35,178 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:35,178 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:35,178 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:35,178 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:35,178 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:35,179 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:35,179 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:35,179 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr8ASSERT_VIOLATIONCONSISTENCYforallrequirements======== [2019-04-05 12:01:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-04-05 12:01:35,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-04-05 12:01:35,180 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:35,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:35,180 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr8ASSERT_VIOLATIONCONSISTENCYforallrequirements]=== [2019-04-05 12:01:35,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:35,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1221236708, now seen corresponding path program 1 times [2019-04-05 12:01:35,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:35,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:35,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:35,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:35,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 12:01:35,189 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 12:01:35,189 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr8ASSERT_VIOLATIONCONSISTENCYforallrequirements was UNSAFE (7/9) [2019-04-05 12:01:35,190 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:35,190 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:35,190 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:35,191 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:35,192 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:35,192 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:35,193 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:35,193 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:35,193 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr4ASSERT_VIOLATIONVACUOUSforID003======== [2019-04-05 12:01:35,194 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-04-05 12:01:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-04-05 12:01:35,195 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:35,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:35,195 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr4ASSERT_VIOLATIONVACUOUSforID003]=== [2019-04-05 12:01:35,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:35,196 INFO L82 PathProgramCache]: Analyzing trace with hash -739148768, now seen corresponding path program 1 times [2019-04-05 12:01:35,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:35,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:35,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:35,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:35,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:35,301 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 12:01:35,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:35,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:35,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-05 12:01:35,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-05 12:01:35,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 12:01:35,303 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-04-05 12:01:35,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:35,364 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-04-05 12:01:35,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 12:01:35,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-04-05 12:01:35,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:35,365 INFO L225 Difference]: With dead ends: 34 [2019-04-05 12:01:35,365 INFO L226 Difference]: Without dead ends: 22 [2019-04-05 12:01:35,366 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 12:01:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-04-05 12:01:35,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-04-05 12:01:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-04-05 12:01:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-04-05 12:01:35,368 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 7 [2019-04-05 12:01:35,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:35,368 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-04-05 12:01:35,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-05 12:01:35,368 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-04-05 12:01:35,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-04-05 12:01:35,369 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:35,369 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:35,369 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr4ASSERT_VIOLATIONVACUOUSforID003]=== [2019-04-05 12:01:35,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:35,370 INFO L82 PathProgramCache]: Analyzing trace with hash -782318405, now seen corresponding path program 1 times [2019-04-05 12:01:35,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:35,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:35,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:35,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:35,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 12:01:35,379 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 12:01:35,380 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr4ASSERT_VIOLATIONVACUOUSforID003 was UNSAFE (8/9) [2019-04-05 12:01:35,380 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:35,381 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:35,381 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:35,381 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:35,381 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:35,381 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:35,381 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:35,381 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:35,381 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID003_ID001======== [2019-04-05 12:01:35,382 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-04-05 12:01:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-04-05 12:01:35,382 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:35,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-04-05 12:01:35,383 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID003_ID001]=== [2019-04-05 12:01:35,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:35,383 INFO L82 PathProgramCache]: Analyzing trace with hash 41052, now seen corresponding path program 1 times [2019-04-05 12:01:35,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:35,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:35,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:35,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:35,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:35,389 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 12:01:35,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:35,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:35,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 12:01:35,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 12:01:35,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:35,390 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-04-05 12:01:35,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:35,391 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-04-05 12:01:35,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 12:01:35,392 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 3 [2019-04-05 12:01:35,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:35,392 INFO L225 Difference]: With dead ends: 18 [2019-04-05 12:01:35,392 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:35,392 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 12:01:35,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:35,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:35,393 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 [2019-04-05 12:01:35,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:35,393 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:35,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 12:01:35,394 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:35,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:35,394 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID003_ID001 was SAFE (9/9) [2019-04-05 12:01:35,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 12:01:35 BoogieIcfgContainer [2019-04-05 12:01:35,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-04-05 12:01:35,396 INFO L168 Benchmark]: Toolchain (without parser) took 302858.49 ms. Allocated memory was 134.2 MB in the beginning and 300.4 MB in the end (delta: 166.2 MB). Free memory was 109.8 MB in the beginning and 258.1 MB in the end (delta: -148.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. [2019-04-05 12:01:35,397 INFO L168 Benchmark]: ReqParser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 111.9 MB in the beginning and 111.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-04-05 12:01:35,398 INFO L168 Benchmark]: PEA to Boogie took 540.84 ms. Allocated memory is still 134.2 MB. Free memory was 109.8 MB in the beginning and 90.6 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2019-04-05 12:01:35,399 INFO L168 Benchmark]: Boogie Printer took 10.37 ms. Allocated memory is still 134.2 MB. Free memory was 90.6 MB in the beginning and 89.9 MB in the end (delta: 708.4 kB). Peak memory consumption was 708.4 kB. Max. memory is 7.1 GB. [2019-04-05 12:01:35,400 INFO L168 Benchmark]: Boogie Preprocessor took 60.31 ms. Allocated memory is still 134.2 MB. Free memory was 89.9 MB in the beginning and 87.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-04-05 12:01:35,400 INFO L168 Benchmark]: RCFGBuilder took 1629.17 ms. Allocated memory was 134.2 MB in the beginning and 170.4 MB in the end (delta: 36.2 MB). Free memory was 87.8 MB in the beginning and 112.8 MB in the end (delta: -25.0 MB). Peak memory consumption was 33.2 MB. Max. memory is 7.1 GB. [2019-04-05 12:01:35,401 INFO L168 Benchmark]: TraceAbstraction took 300608.26 ms. Allocated memory was 170.4 MB in the beginning and 300.4 MB in the end (delta: 130.0 MB). Free memory was 112.1 MB in the beginning and 258.1 MB in the end (delta: -146.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-04-05 12:01:35,407 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.21 ms. Allocated memory is still 134.2 MB. Free memory was 111.9 MB in the beginning and 111.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * PEA to Boogie took 540.84 ms. Allocated memory is still 134.2 MB. Free memory was 109.8 MB in the beginning and 90.6 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * Boogie Printer took 10.37 ms. Allocated memory is still 134.2 MB. Free memory was 90.6 MB in the beginning and 89.9 MB in the end (delta: 708.4 kB). Peak memory consumption was 708.4 kB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.31 ms. Allocated memory is still 134.2 MB. Free memory was 89.9 MB in the beginning and 87.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1629.17 ms. Allocated memory was 134.2 MB in the beginning and 170.4 MB in the end (delta: 36.2 MB). Free memory was 87.8 MB in the beginning and 112.8 MB in the end (delta: -25.0 MB). Peak memory consumption was 33.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 300608.26 ms. Allocated memory was 170.4 MB in the beginning and 300.4 MB in the end (delta: 130.0 MB). Free memory was 112.1 MB in the beginning and 258.1 MB in the end (delta: -146.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that Requirements ID001, ID002 are rt-consistent (line -1). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_ID002 CFG has 1 procedures, 21 locations, 9 error locations. TIMEOUT Result, 300.1s OverallTime, 4 OverallIterations, 4 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 SDtfs, 108 SDslu, 170 SDs, 0 SdLazy, 74 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=3, 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, 3 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 28.4s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 35 NumberOfNonLiveVariables, 158 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/50 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: myProcedureErr6ASSERT_VIOLATIONVACUOUSforID004 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, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID002 is non-vacuous Requirement ID002 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr7ASSERT_VIOLATIONVACUOUSforID002 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, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID003, ID002 are rt-consistent Requirements ID003, ID002 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID003_ID002 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 - ReqCheckSuccessResult [Line: -1]: Requirements ID003, ID004 are rt-consistent Requirements ID003, ID004 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID003_ID004 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 ID001 is non-vacuous Requirement ID001 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr5ASSERT_VIOLATIONVACUOUSforID001 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 [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 - ReqCheckSuccessResult [Line: -1]: Requirement ID003 is non-vacuous Requirement ID003 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr4ASSERT_VIOLATIONVACUOUSforID003 CFG has 1 procedures, 21 locations, 9 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16 SDtfs, 10 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.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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 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 ID003, ID001 are rt-consistent Requirements ID003, ID001 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID003_ID001 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, 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 RESULT: Ultimate could not prove your program: Timeout Received shutdown request...