java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc /storage/repos/ultimate/trunk/examples/toolchains/ReqCheck.xml -s /storage/repos/ultimate/trunk/examples/settings/reqanalyzer/reqanalyzer-nonlin.epf --traceabstraction.limit.analysis.time 300 --pea2boogie.always.use.all.invariants.during.rt-inconsistency.checks true --pea2boogie.check.vacuity true --pea2boogie.check.consistency true --pea2boogie.check.rt-inconsistency true --pea2boogie.report.trivial.rt-consistency false --pea2boogie.rt-inconsistency.range 2 -i /storage/repos/re2019-exp/Lambda.new.req -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a613b84 [2019-04-04 17:46:37,996 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-04-04 17:46:38,001 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-04-04 17:46:38,019 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-04-04 17:46:38,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-04-04 17:46:38,020 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-04-04 17:46:38,024 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-04-04 17:46:38,027 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-04-04 17:46:38,028 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-04-04 17:46:38,029 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-04-04 17:46:38,031 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-04-04 17:46:38,031 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-04-04 17:46:38,032 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-04-04 17:46:38,033 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-04-04 17:46:38,034 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-04-04 17:46:38,035 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-04-04 17:46:38,036 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-04-04 17:46:38,038 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-04-04 17:46:38,043 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-04-04 17:46:38,045 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-04-04 17:46:38,046 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-04-04 17:46:38,047 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-04-04 17:46:38,051 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-04-04 17:46:38,051 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-04-04 17:46:38,051 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-04-04 17:46:38,052 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-04-04 17:46:38,054 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-04-04 17:46:38,056 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-04-04 17:46:38,056 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-04-04 17:46:38,057 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-04-04 17:46:38,058 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-04-04 17:46:38,059 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-04-04 17:46:38,063 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-04-04 17:46:38,063 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-04-04 17:46:38,063 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-04-04 17:46:38,064 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-04-04 17:46:38,064 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-04-04 17:46:38,066 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-04-04 17:46:38,068 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-04-04 17:46:38,068 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/trunk/examples/settings/reqanalyzer/reqanalyzer-nonlin.epf [2019-04-04 17:46:38,085 INFO L110 SettingsManager]: Loading preferences was successful [2019-04-04 17:46:38,085 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-04-04 17:46:38,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-04-04 17:46:38,086 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2019-04-04 17:46:38,087 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-04-04 17:46:38,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:12000 [2019-04-04 17:46:38,088 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-04-04 17:46:38,088 INFO L133 SettingsManager]: * Trace refinement exception blacklist=UNKNOWN [2019-04-04 17:46:38,088 INFO L133 SettingsManager]: * Stop after first violation was found=false [2019-04-04 17:46:38,088 INFO L133 SettingsManager]: * Compute statistics for interpolant sequences=false [2019-04-04 17:46:38,088 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM [2019-04-04 17:46:38,089 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-04-04 17:46:38,089 INFO L133 SettingsManager]: * Compute trace for counterexample result=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit analysis time -> 300 Applying setting for plugin de.uni_freiburg.informatik.ultimate.pea2boogie: Always use all invariants during rt-inconsistency checks -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.pea2boogie: Check vacuity -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.pea2boogie: Check consistency -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.pea2boogie: Check rt-inconsistency -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.pea2boogie: Report trivial rt-consistency -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.pea2boogie: Rt-inconsistency range -> 2 [2019-04-04 17:46:38,133 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-04-04 17:46:38,146 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-04-04 17:46:38,150 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-04-04 17:46:38,151 INFO L271 PluginConnector]: Initializing ReqParser... [2019-04-04 17:46:38,152 INFO L276 PluginConnector]: ReqParser initialized [2019-04-04 17:46:38,153 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/re2019-exp/Lambda.new.req [2019-04-04 17:46:38,153 INFO L94 ReqParser]: Parsing file /storage/repos/re2019-exp/Lambda.new.req [2019-04-04 17:46:38,238 INFO L134 ReqParser]: 87 requirements (48 non-initialization) in total [2019-04-04 17:46:38,248 WARN L69 ReqParserResultUtil]: The following requirements have been merged because they are equivalent: ID039, ID035 [2019-04-04 17:46:38,250 INFO L134 ReqParser]: 86 requirements (47 non-initialization) after unification [2019-04-04 17:46:38,257 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-04-04 17:46:38,259 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-04-04 17:46:38,260 INFO L113 PluginConnector]: ------------------------PEA to Boogie---------------------------- [2019-04-04 17:46:38,260 INFO L271 PluginConnector]: Initializing PEA to Boogie... [2019-04-04 17:46:38,260 INFO L276 PluginConnector]: PEA to Boogie initialized [2019-04-04 17:46:38,262 INFO L185 PluginConnector]: Executing the observer PEAtoBoogieObserver from plugin PEA to Boogie for "de.uni_freiburg.informatik.ultimate.reqparser OTHER 04.04 05:46:38" (1/1) ... [2019-04-04 17:46:38,272 INFO L157 Req2BoogieTranslator]: Check vacuity=true, Rt-inconsistency range=2, Check consistency=true, Report trivial rt-consistency=false, Always use all invariants during rt-inconsistency checks=true [2019-04-04 17:46:38,288 INFO L59 ReqToPEA]: Transforming 47 requirements to PEAs [2019-04-04 17:46:38,363 WARN L70 PeaResultUtil]: Ignored requirement due to translation errors: ID016 Reason: class java.lang.NullPointerException [2019-04-04 17:46:38,384 INFO L87 ReqToPEA]: Following types of requirements were processed [2019-04-04 17:46:38,384 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.InstAbsPattern : 9 [2019-04-04 17:46:38,384 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.BndInvariancePattern : 7 [2019-04-04 17:46:38,385 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.UniversalityPattern : 10 [2019-04-04 17:46:38,385 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.BndResponsePatternUT : 19 [2019-04-04 17:46:38,385 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.MinDurationPattern : 1 [2019-04-04 17:46:38,385 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.InvariantPattern : 1 [2019-04-04 17:46:38,386 INFO L92 ReqToPEA]: Finished transforming 47 requirements to PEAs No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-04-04 17:46:38,992 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-04-04 17:46:38,993 INFO L154 cyConditionGenerator]: Finished generating primed state invariant of size 57 [2019-04-04 17:46:39,018 WARN L496 Req2BoogieTranslator]: phase without clock or state invariant for ID015: Before "x0025", it is always the case that if "x0018" holds, then "x0007" holds after at most "10" time units [2019-04-04 17:46:39,032 INFO L769 Req2BoogieTranslator]: 11 of 46 requirements are invariant [2019-04-04 17:46:39,034 INFO L786 Req2BoogieTranslator]: Computing rt-inconsistency assertions for 595 subsets [2019-04-04 17:50:09,472 INFO L284 cyConditionGenerator]: 595 checks, 443 trivial consistent, 152 non-trivial [2019-04-04 17:50:09,473 INFO L290 cyConditionGenerator]: Of 7189 formulas, 0 were quantified, 7189 were plain. Needed 2957 quantifier elimination runs, 0 quantified solver queries. [2019-04-04 17:50:09,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:50:09 Unit [2019-04-04 17:50:09,489 INFO L132 PluginConnector]: ------------------------ END PEA to Boogie---------------------------- [2019-04-04 17:50:09,490 INFO L113 PluginConnector]: ------------------------Boogie Printer---------------------------- [2019-04-04 17:50:09,490 INFO L271 PluginConnector]: Initializing Boogie Printer... [2019-04-04 17:50:09,491 INFO L276 PluginConnector]: Boogie Printer initialized [2019-04-04 17:50:09,492 INFO L185 PluginConnector]: Executing the observer BoogiePrinterObserver from plugin Boogie Printer for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:50:09" (1/1) ... [2019-04-04 17:50:09,492 INFO L116 oogiePrinterObserver]: File already exists and will be overwritten: /tmp/boogiePrinter.bpl [2019-04-04 17:50:09,492 INFO L120 oogiePrinterObserver]: Writing to file /tmp/boogiePrinter.bpl [2019-04-04 17:50:09,523 INFO L132 PluginConnector]: ------------------------ END Boogie Printer---------------------------- [2019-04-04 17:50:09,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-04-04 17:50:09,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-04-04 17:50:09,524 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-04-04 17:50:09,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:50:09" (1/1) ... [2019-04-04 17:50:09,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:50:09" (1/1) ... [2019-04-04 17:50:09,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:50:09" (1/1) ... [2019-04-04 17:50:09,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:50:09" (1/1) ... [2019-04-04 17:50:09,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:50:09" (1/1) ... [2019-04-04 17:50:09,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:50:09" (1/1) ... [2019-04-04 17:50:09,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:50:09" (1/1) ... [2019-04-04 17:50:09,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-04-04 17:50:09,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-04-04 17:50:09,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-04-04 17:50:09,659 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-04-04 17:50:09,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:50:09" (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-04 17:50:09,689 INFO L124 BoogieDeclarations]: Specification and implementation of procedure myProcedure given in one single declaration [2019-04-04 17:50:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure myProcedure [2019-04-04 17:50:09,689 INFO L138 BoogieDeclarations]: Found implementation of procedure myProcedure [2019-04-04 17:50:16,640 INFO L278 CfgBuilder]: Using library mode [2019-04-04 17:50:16,640 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-04-04 17:50:16,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 05:50:16 BoogieIcfgContainer [2019-04-04 17:50:16,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-04-04 17:50:16,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-04-04 17:50:16,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-04-04 17:50:16,646 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-04-04 17:50:16,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.reqparser OTHER 04.04 05:46:38" (1/3) ... [2019-04-04 17:50:16,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50363d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 04.04 05:50:16, skipping insertion in model container [2019-04-04 17:50:16,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 05:50:09" (2/3) ... [2019-04-04 17:50:16,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50363d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 05:50:16, skipping insertion in model container [2019-04-04 17:50:16,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 05:50:16" (3/3) ... [2019-04-04 17:50:16,650 INFO L112 eAbstractionObserver]: Analyzing ICFG [2019-04-04 17:50:16,657 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-04-04 17:50:16,662 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 188 error locations. [2019-04-04 17:50:16,674 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:16,695 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:16,695 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:16,695 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:16,695 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:16,696 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:16,696 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:16,696 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:16,696 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID041_ID020======== [2019-04-04 17:50:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-04-04 17:50:16,725 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:16,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:16,727 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID041_ID020]=== [2019-04-04 17:50:16,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:16,732 INFO L82 PathProgramCache]: Analyzing trace with hash 314571711, now seen corresponding path program 1 times [2019-04-04 17:50:16,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:16,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:16,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:16,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:16,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:16,983 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:16,992 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID041_ID020 was UNSAFE (1/188) [2019-04-04 17:50:16,996 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:16,996 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:16,997 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:16,997 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:16,997 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:16,997 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:16,997 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:16,997 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:16,997 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID041_ID033======== [2019-04-04 17:50:17,010 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-04-04 17:50:17,010 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:17,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:17,013 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID041_ID033]=== [2019-04-04 17:50:17,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:17,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1161789201, now seen corresponding path program 1 times [2019-04-04 17:50:17,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:17,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:17,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:17,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:17,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:50:17,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:50:17,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:50:17,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:50:17,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:50:17,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:50:17,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:50:17,209 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:50:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:50:17,250 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:50:17,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:50:17,252 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-04-04 17:50:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:50:17,259 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:50:17,259 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:50:17,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:50:17,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:50:17,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:50:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:50:17,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:50:17,284 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-04-04 17:50:17,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:50:17,284 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:50:17,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:50:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:50:17,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:50:17,285 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID041_ID033 was SAFE (2/188) [2019-04-04 17:50:17,286 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:17,287 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:17,287 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:17,287 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:17,287 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:17,287 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:17,287 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:17,287 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:17,288 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr128ASSERT_VIOLATIONRTINCONSISTENTforID035_ID033======== [2019-04-04 17:50:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:17,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-04-04 17:50:17,299 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:17,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:17,300 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr128ASSERT_VIOLATIONRTINCONSISTENTforID035_ID033]=== [2019-04-04 17:50:17,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:17,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2041438277, now seen corresponding path program 1 times [2019-04-04 17:50:17,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:17,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:17,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:17,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:50:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:50:17,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:50:17,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:50:17,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:50:17,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:50:17,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:50:17,371 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:50:17,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:50:17,387 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:50:17,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:50:17,387 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 131 [2019-04-04 17:50:17,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:50:17,388 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:50:17,388 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:50:17,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:50:17,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:50:17,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:50:17,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:50:17,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:50:17,390 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 131 [2019-04-04 17:50:17,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:50:17,390 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:50:17,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:50:17,390 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:50:17,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:50:17,391 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr128ASSERT_VIOLATIONRTINCONSISTENTforID035_ID033 was SAFE (3/188) [2019-04-04 17:50:17,392 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:17,392 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:17,392 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:17,393 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:17,393 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:17,393 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:17,393 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:17,393 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:17,393 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID041_ID031======== [2019-04-04 17:50:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-04-04 17:50:17,397 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:17,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-04-04 17:50:17,397 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID041_ID031]=== [2019-04-04 17:50:17,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:17,398 INFO L82 PathProgramCache]: Analyzing trace with hash 5200653, now seen corresponding path program 1 times [2019-04-04 17:50:17,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:17,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:17,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:17,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:17,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:17,441 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:17,442 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID041_ID031 was UNSAFE (4/188) [2019-04-04 17:50:17,443 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:17,443 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:17,443 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:17,443 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:17,443 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:17,444 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:17,445 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:17,445 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:17,446 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr46ASSERT_VIOLATIONRTINCONSISTENTforID021_ID019======== [2019-04-04 17:50:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:17,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-04-04 17:50:17,450 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:17,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:17,451 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr46ASSERT_VIOLATIONRTINCONSISTENTforID021_ID019]=== [2019-04-04 17:50:17,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:17,451 INFO L82 PathProgramCache]: Analyzing trace with hash 985342761, now seen corresponding path program 1 times [2019-04-04 17:50:17,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:17,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:17,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:17,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:17,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:50:18,173 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-04-04 17:50:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:50:18,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:50:18,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:50:18,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:50:18,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:50:18,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:50:18,199 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:50:18,676 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2019-04-04 17:50:19,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:50:19,020 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:50:19,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:50:19,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-04-04 17:50:19,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:50:19,037 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:50:19,038 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:50:19,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:50:19,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:50:19,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 239. [2019-04-04 17:50:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-04-04 17:50:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2019-04-04 17:50:19,087 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 49 [2019-04-04 17:50:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:50:19,088 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2019-04-04 17:50:19,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:50:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2019-04-04 17:50:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-04-04 17:50:19,101 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:19,101 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:19,102 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr46ASSERT_VIOLATIONRTINCONSISTENTforID021_ID019]=== [2019-04-04 17:50:19,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:19,102 INFO L82 PathProgramCache]: Analyzing trace with hash 95587290, now seen corresponding path program 1 times [2019-04-04 17:50:19,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:19,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:19,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:19,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:19,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:50:19,829 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-04-04 17:50:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:50:19,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:50:19,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:50:19,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:50:20,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 21 conjunts are in the unsatisfiable core [2019-04-04 17:50:20,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:50:20,331 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-04-04 17:50:20,661 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 27 [2019-04-04 17:50:25,421 WARN L188 SmtUtils]: Spent 3.18 s on a formula simplification. DAG size of input: 168 DAG size of output: 94 [2019-04-04 17:50:25,923 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 25 [2019-04-04 17:50:25,935 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:50:25,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:50:25,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-04-04 17:50:25,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-04-04 17:50:25,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-04-04 17:50:25,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-04-04 17:50:25,969 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 10 states. [2019-04-04 17:50:26,309 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-04-04 17:50:28,226 WARN L188 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 111 DAG size of output: 110 [2019-04-04 17:50:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:50:28,356 INFO L93 Difference]: Finished difference Result 569 states and 569 transitions. [2019-04-04 17:50:28,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-04 17:50:28,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 238 [2019-04-04 17:50:28,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:50:28,372 INFO L225 Difference]: With dead ends: 569 [2019-04-04 17:50:28,372 INFO L226 Difference]: Without dead ends: 569 [2019-04-04 17:50:28,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-04-04 17:50:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-04-04 17:50:28,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 428. [2019-04-04 17:50:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-04-04 17:50:28,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 428 transitions. [2019-04-04 17:50:28,415 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 428 transitions. Word has length 238 [2019-04-04 17:50:28,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:50:28,417 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 428 transitions. [2019-04-04 17:50:28,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-04-04 17:50:28,417 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 428 transitions. [2019-04-04 17:50:28,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-04-04 17:50:28,431 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:28,432 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-04-04 17:50:28,432 INFO L423 AbstractCegarLoop]: === Iteration 3 === [myProcedureErr46ASSERT_VIOLATIONRTINCONSISTENTforID021_ID019]=== [2019-04-04 17:50:28,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:28,433 INFO L82 PathProgramCache]: Analyzing trace with hash 430006473, now seen corresponding path program 2 times [2019-04-04 17:50:28,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:28,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:28,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:28,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:28,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:28,606 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:28,609 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr46ASSERT_VIOLATIONRTINCONSISTENTforID021_ID019 was UNSAFE (5/188) [2019-04-04 17:50:28,610 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:28,611 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:28,611 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:28,611 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:28,611 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:28,611 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:28,611 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:28,611 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:28,612 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr187ASSERT_VIOLATIONCONSISTENCYforallrequirements======== [2019-04-04 17:50:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:28,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-04-04 17:50:28,618 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:28,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:28,618 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr187ASSERT_VIOLATIONCONSISTENCYforallrequirements]=== [2019-04-04 17:50:28,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:28,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1180180025, now seen corresponding path program 1 times [2019-04-04 17:50:28,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:28,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:28,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:28,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:28,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:28,641 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:28,644 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr187ASSERT_VIOLATIONCONSISTENCYforallrequirements was UNSAFE (6/188) [2019-04-04 17:50:28,645 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:28,645 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:28,645 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:28,645 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:28,646 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:28,646 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:28,646 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:28,646 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:28,646 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr98ASSERT_VIOLATIONRTINCONSISTENTforID042_ID020======== [2019-04-04 17:50:28,650 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-04-04 17:50:28,652 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:28,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:28,653 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr98ASSERT_VIOLATIONRTINCONSISTENTforID042_ID020]=== [2019-04-04 17:50:28,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:28,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1637206563, now seen corresponding path program 1 times [2019-04-04 17:50:28,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:28,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:28,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:28,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:28,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:28,678 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:28,680 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr98ASSERT_VIOLATIONRTINCONSISTENTforID042_ID020 was UNSAFE (7/188) [2019-04-04 17:50:28,681 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:28,681 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:28,681 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:28,681 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:28,681 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:28,682 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:28,682 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:28,682 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:28,682 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr108ASSERT_VIOLATIONRTINCONSISTENTforID028_ID020======== [2019-04-04 17:50:28,687 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-04-04 17:50:28,688 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:28,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:28,689 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr108ASSERT_VIOLATIONRTINCONSISTENTforID028_ID020]=== [2019-04-04 17:50:28,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:28,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1498472153, now seen corresponding path program 1 times [2019-04-04 17:50:28,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:28,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:28,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:28,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:28,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:28,718 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:28,719 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr108ASSERT_VIOLATIONRTINCONSISTENTforID028_ID020 was UNSAFE (8/188) [2019-04-04 17:50:28,720 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:28,720 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:28,720 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:28,720 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:28,720 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:28,720 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:28,721 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:28,721 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:28,721 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr36ASSERT_VIOLATIONRTINCONSISTENTforID044_ID020======== [2019-04-04 17:50:28,724 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-04-04 17:50:28,725 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:28,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:28,726 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr36ASSERT_VIOLATIONRTINCONSISTENTforID044_ID020]=== [2019-04-04 17:50:28,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:28,726 INFO L82 PathProgramCache]: Analyzing trace with hash -286335009, now seen corresponding path program 1 times [2019-04-04 17:50:28,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:28,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:28,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:28,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:28,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:28,753 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:28,754 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr36ASSERT_VIOLATIONRTINCONSISTENTforID044_ID020 was UNSAFE (9/188) [2019-04-04 17:50:28,754 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:28,755 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:28,755 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:28,755 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:28,755 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:28,755 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:28,755 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:28,755 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:28,756 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr152ASSERT_VIOLATIONVACUOUSforID041======== [2019-04-04 17:50:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:28,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-04-04 17:50:28,761 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:28,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:28,762 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr152ASSERT_VIOLATIONVACUOUSforID041]=== [2019-04-04 17:50:28,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:28,762 INFO L82 PathProgramCache]: Analyzing trace with hash -975779117, now seen corresponding path program 1 times [2019-04-04 17:50:28,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:28,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:28,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:28,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:28,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:28,790 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:28,792 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr152ASSERT_VIOLATIONVACUOUSforID041 was UNSAFE (10/188) [2019-04-04 17:50:28,792 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:28,793 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:28,793 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:28,793 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:28,793 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:28,793 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:28,793 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:28,793 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:28,794 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr134ASSERT_VIOLATIONRTINCONSISTENTforID023_ID033======== [2019-04-04 17:50:28,797 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:28,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-04-04 17:50:28,799 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:28,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:28,799 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr134ASSERT_VIOLATIONRTINCONSISTENTforID023_ID033]=== [2019-04-04 17:50:28,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:28,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1771697793, now seen corresponding path program 1 times [2019-04-04 17:50:28,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:28,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:28,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:28,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:28,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:50:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:50:28,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:50:28,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:50:28,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:50:28,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:50:28,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:50:28,853 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:50:28,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:50:28,857 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:50:28,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:50:28,857 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 137 [2019-04-04 17:50:28,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:50:28,858 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:50:28,858 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:50:28,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:50:28,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:50:28,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:50:28,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:50:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:50:28,859 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 137 [2019-04-04 17:50:28,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:50:28,860 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:50:28,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:50:28,860 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:50:28,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:50:28,861 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr134ASSERT_VIOLATIONRTINCONSISTENTforID023_ID033 was SAFE (11/188) [2019-04-04 17:50:28,862 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:28,862 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:28,862 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:28,862 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:28,863 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:28,863 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:28,863 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:28,863 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:28,863 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr142ASSERT_VIOLATIONRTINCONSISTENTforID020_ID022======== [2019-04-04 17:50:28,867 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:28,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-04-04 17:50:28,870 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:28,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:28,870 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr142ASSERT_VIOLATIONRTINCONSISTENTforID020_ID022]=== [2019-04-04 17:50:28,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:28,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1735937929, now seen corresponding path program 1 times [2019-04-04 17:50:28,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:28,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:28,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:28,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:28,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:50:29,367 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-04-04 17:50:29,890 WARN L188 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2019-04-04 17:50:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:50:29,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:50:29,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:50:29,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:50:29,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:50:29,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:50:29,892 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:50:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:50:30,289 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:50:30,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:50:30,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-04-04 17:50:30,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:50:30,293 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:50:30,294 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:50:30,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:50:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:50:30,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 335. [2019-04-04 17:50:30,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-04-04 17:50:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2019-04-04 17:50:30,322 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 145 [2019-04-04 17:50:30,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:50:30,323 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2019-04-04 17:50:30,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:50:30,323 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2019-04-04 17:50:30,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-04-04 17:50:30,332 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:30,332 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:30,333 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr142ASSERT_VIOLATIONRTINCONSISTENTforID020_ID022]=== [2019-04-04 17:50:30,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:30,333 INFO L82 PathProgramCache]: Analyzing trace with hash -918901702, now seen corresponding path program 1 times [2019-04-04 17:50:30,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:30,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:30,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:30,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:30,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:30,429 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:30,431 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr142ASSERT_VIOLATIONRTINCONSISTENTforID020_ID022 was UNSAFE (12/188) [2019-04-04 17:50:30,431 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:30,432 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:30,432 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:30,432 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:30,432 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:30,432 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:30,432 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:30,432 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:30,433 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr156ASSERT_VIOLATIONVACUOUSforID015======== [2019-04-04 17:50:30,438 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:30,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-04-04 17:50:30,440 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:30,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:30,441 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr156ASSERT_VIOLATIONVACUOUSforID015]=== [2019-04-04 17:50:30,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:30,441 INFO L82 PathProgramCache]: Analyzing trace with hash 384530263, now seen corresponding path program 1 times [2019-04-04 17:50:30,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:30,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:30,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:30,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:30,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:30,463 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:30,464 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr156ASSERT_VIOLATIONVACUOUSforID015 was UNSAFE (13/188) [2019-04-04 17:50:30,467 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:30,468 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:30,468 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:30,468 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:30,468 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:30,468 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:30,468 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:30,468 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:30,468 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr81ASSERT_VIOLATIONRTINCONSISTENTforID031_ID018======== [2019-04-04 17:50:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:30,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-04-04 17:50:30,477 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:30,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:30,478 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr81ASSERT_VIOLATIONRTINCONSISTENTforID031_ID018]=== [2019-04-04 17:50:30,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:30,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2086005597, now seen corresponding path program 1 times [2019-04-04 17:50:30,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:30,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:30,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:30,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:30,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:30,500 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:30,501 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr81ASSERT_VIOLATIONRTINCONSISTENTforID031_ID018 was UNSAFE (14/188) [2019-04-04 17:50:30,503 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:30,503 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:30,503 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:30,504 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:30,504 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:30,504 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:30,504 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:30,504 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:30,504 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr138ASSERT_VIOLATIONRTINCONSISTENTforID025_ID033======== [2019-04-04 17:50:30,508 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:30,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-04-04 17:50:30,510 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:30,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:30,511 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr138ASSERT_VIOLATIONRTINCONSISTENTforID025_ID033]=== [2019-04-04 17:50:30,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:30,511 INFO L82 PathProgramCache]: Analyzing trace with hash -2002504955, now seen corresponding path program 1 times [2019-04-04 17:50:30,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:30,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:30,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:30,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:30,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:50:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:50:30,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:50:30,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:50:30,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:50:30,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:50:30,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:50:30,579 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:50:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:50:30,582 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:50:30,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:50:30,582 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 141 [2019-04-04 17:50:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:50:30,583 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:50:30,583 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:50:30,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:50:30,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:50:30,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:50:30,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:50:30,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:50:30,584 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2019-04-04 17:50:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:50:30,584 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:50:30,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:50:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:50:30,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:50:30,585 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr138ASSERT_VIOLATIONRTINCONSISTENTforID025_ID033 was SAFE (15/188) [2019-04-04 17:50:30,586 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:30,586 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:30,586 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:30,586 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:30,586 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:30,586 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:30,586 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:30,586 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:30,587 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr161ASSERT_VIOLATIONVACUOUSforID017======== [2019-04-04 17:50:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:30,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-04-04 17:50:30,592 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:30,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:30,593 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr161ASSERT_VIOLATIONVACUOUSforID017]=== [2019-04-04 17:50:30,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:30,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1697545133, now seen corresponding path program 1 times [2019-04-04 17:50:30,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:30,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:30,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:30,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:30,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:30,612 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:30,613 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr161ASSERT_VIOLATIONVACUOUSforID017 was UNSAFE (16/188) [2019-04-04 17:50:30,614 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:30,614 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:30,614 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:30,614 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:30,614 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:30,615 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:30,615 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:30,615 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:30,615 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr175ASSERT_VIOLATIONVACUOUSforID035======== [2019-04-04 17:50:30,618 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-04-04 17:50:30,620 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:30,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:30,620 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr175ASSERT_VIOLATIONVACUOUSforID035]=== [2019-04-04 17:50:30,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:30,620 INFO L82 PathProgramCache]: Analyzing trace with hash 832161211, now seen corresponding path program 1 times [2019-04-04 17:50:30,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:30,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:30,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:30,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:30,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:50:30,877 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-04-04 17:50:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:50:30,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:50:30,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:50:30,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:50:30,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:50:30,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:50:30,882 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:50:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:50:31,003 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:50:31,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:50:31,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-04-04 17:50:31,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:50:31,006 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:50:31,006 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:50:31,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:50:31,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:50:31,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 368. [2019-04-04 17:50:31,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-04-04 17:50:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 368 transitions. [2019-04-04 17:50:31,015 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 368 transitions. Word has length 178 [2019-04-04 17:50:31,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:50:31,015 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 368 transitions. [2019-04-04 17:50:31,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:50:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 368 transitions. [2019-04-04 17:50:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-04-04 17:50:31,018 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:31,018 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:31,018 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr175ASSERT_VIOLATIONVACUOUSforID035]=== [2019-04-04 17:50:31,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:31,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1032422186, now seen corresponding path program 1 times [2019-04-04 17:50:31,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:31,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:31,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:31,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:31,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:50:31,829 WARN L188 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2019-04-04 17:50:31,862 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:50:31,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:50:31,863 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:50:31,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:50:32,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 9 conjunts are in the unsatisfiable core [2019-04-04 17:50:32,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:50:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:50:32,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:50:32,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-04-04 17:50:32,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-04-04 17:50:32,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-04-04 17:50:32,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-04-04 17:50:32,387 INFO L87 Difference]: Start difference. First operand 368 states and 368 transitions. Second operand 7 states. [2019-04-04 17:50:32,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:50:32,538 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2019-04-04 17:50:32,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-04 17:50:32,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 367 [2019-04-04 17:50:32,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:50:32,540 INFO L225 Difference]: With dead ends: 379 [2019-04-04 17:50:32,540 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:50:32,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 362 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-04-04 17:50:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:50:32,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:50:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:50:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:50:32,541 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 367 [2019-04-04 17:50:32,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:50:32,541 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:50:32,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-04-04 17:50:32,542 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:50:32,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:50:32,543 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr175ASSERT_VIOLATIONVACUOUSforID035 was SAFE (17/188) [2019-04-04 17:50:32,543 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:32,544 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:32,544 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:32,544 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:32,544 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:32,544 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:32,544 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:32,544 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:32,545 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID041_ID042======== [2019-04-04 17:50:32,547 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:32,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-04-04 17:50:32,548 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:32,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-04-04 17:50:32,548 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID041_ID042]=== [2019-04-04 17:50:32,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:32,548 INFO L82 PathProgramCache]: Analyzing trace with hash 161220989, now seen corresponding path program 1 times [2019-04-04 17:50:32,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:32,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:32,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:32,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:32,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:32,567 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:32,568 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID041_ID042 was UNSAFE (18/188) [2019-04-04 17:50:32,568 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:32,569 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:32,569 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:32,569 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:32,569 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:32,569 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:32,569 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:32,569 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:32,570 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr173ASSERT_VIOLATIONVACUOUSforID030======== [2019-04-04 17:50:32,572 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:32,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-04-04 17:50:32,574 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:32,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:32,574 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr173ASSERT_VIOLATIONVACUOUSforID030]=== [2019-04-04 17:50:32,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:32,574 INFO L82 PathProgramCache]: Analyzing trace with hash -477345863, now seen corresponding path program 1 times [2019-04-04 17:50:32,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:32,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:32,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:32,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:32,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:32,591 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:32,592 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr173ASSERT_VIOLATIONVACUOUSforID030 was UNSAFE (19/188) [2019-04-04 17:50:32,592 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:32,593 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:32,593 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:32,593 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:32,593 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:32,593 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:32,593 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:32,593 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:32,593 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr26ASSERT_VIOLATIONRTINCONSISTENTforID044_ID046======== [2019-04-04 17:50:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:32,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-04-04 17:50:32,596 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:32,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:32,597 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr26ASSERT_VIOLATIONRTINCONSISTENTforID044_ID046]=== [2019-04-04 17:50:32,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:32,597 INFO L82 PathProgramCache]: Analyzing trace with hash -684043115, now seen corresponding path program 1 times [2019-04-04 17:50:32,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:32,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:32,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:32,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:32,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:32,615 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:32,616 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr26ASSERT_VIOLATIONRTINCONSISTENTforID044_ID046 was UNSAFE (20/188) [2019-04-04 17:50:32,616 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:32,617 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:32,617 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:32,617 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:32,617 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:32,617 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:32,617 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:32,617 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:32,618 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr29ASSERT_VIOLATIONRTINCONSISTENTforID044_ID031======== [2019-04-04 17:50:32,620 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-04-04 17:50:32,621 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:32,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:32,621 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr29ASSERT_VIOLATIONRTINCONSISTENTforID044_ID031]=== [2019-04-04 17:50:32,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:32,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1292171049, now seen corresponding path program 1 times [2019-04-04 17:50:32,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:32,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:32,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:32,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:32,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:32,639 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:32,639 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr29ASSERT_VIOLATIONRTINCONSISTENTforID044_ID031 was UNSAFE (21/188) [2019-04-04 17:50:32,640 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:32,640 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:32,640 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:32,640 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:32,641 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:32,641 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:32,641 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:32,641 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:32,641 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr86ASSERT_VIOLATIONRTINCONSISTENTforID031_ID023======== [2019-04-04 17:50:32,644 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:32,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-04-04 17:50:32,645 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:32,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:32,645 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr86ASSERT_VIOLATIONRTINCONSISTENTforID031_ID023]=== [2019-04-04 17:50:32,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:32,645 INFO L82 PathProgramCache]: Analyzing trace with hash -975085487, now seen corresponding path program 1 times [2019-04-04 17:50:32,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:32,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:32,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:32,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:32,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:32,664 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:32,665 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr86ASSERT_VIOLATIONRTINCONSISTENTforID031_ID023 was UNSAFE (22/188) [2019-04-04 17:50:32,665 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:32,666 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:32,666 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:32,666 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:32,666 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:32,666 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:32,666 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:32,666 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:32,666 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr92ASSERT_VIOLATIONRTINCONSISTENTforID042_ID018======== [2019-04-04 17:50:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:32,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-04-04 17:50:32,670 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:32,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:32,670 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr92ASSERT_VIOLATIONRTINCONSISTENTforID042_ID018]=== [2019-04-04 17:50:32,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:32,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2072096535, now seen corresponding path program 1 times [2019-04-04 17:50:32,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:32,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:32,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:32,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:32,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:32,696 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:32,697 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr92ASSERT_VIOLATIONRTINCONSISTENTforID042_ID018 was UNSAFE (23/188) [2019-04-04 17:50:32,698 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:32,698 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:32,698 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:32,698 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:32,698 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:32,698 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:32,698 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:32,699 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:32,699 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr179ASSERT_VIOLATIONVACUOUSforID023======== [2019-04-04 17:50:32,701 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:32,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-04-04 17:50:32,703 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:32,703 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:32,703 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr179ASSERT_VIOLATIONVACUOUSforID023]=== [2019-04-04 17:50:32,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:32,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1585686081, now seen corresponding path program 1 times [2019-04-04 17:50:32,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:32,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:32,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:32,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:32,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:32,723 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:32,725 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr179ASSERT_VIOLATIONVACUOUSforID023 was UNSAFE (24/188) [2019-04-04 17:50:32,725 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:32,726 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:32,726 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:32,726 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:32,726 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:32,726 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:32,726 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:32,726 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:32,726 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr183ASSERT_VIOLATIONVACUOUSforID022======== [2019-04-04 17:50:32,730 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:32,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-04-04 17:50:32,732 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:32,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:32,733 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr183ASSERT_VIOLATIONVACUOUSforID022]=== [2019-04-04 17:50:32,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:32,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1982926275, now seen corresponding path program 1 times [2019-04-04 17:50:32,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:32,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:32,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:32,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:32,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:32,754 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:32,755 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr183ASSERT_VIOLATIONVACUOUSforID022 was UNSAFE (25/188) [2019-04-04 17:50:32,756 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:32,756 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:32,756 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:32,756 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:32,756 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:32,757 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:32,757 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:32,757 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:32,757 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr104ASSERT_VIOLATIONRTINCONSISTENTforID018_ID020======== [2019-04-04 17:50:32,761 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:32,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-04-04 17:50:32,761 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:32,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:32,762 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr104ASSERT_VIOLATIONRTINCONSISTENTforID018_ID020]=== [2019-04-04 17:50:32,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:32,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1972434083, now seen corresponding path program 1 times [2019-04-04 17:50:32,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:32,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:32,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:32,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:32,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:50:33,039 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-04-04 17:50:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:50:33,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:50:33,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:50:33,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:50:33,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:50:33,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:50:33,068 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:50:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:50:34,092 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:50:34,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:50:34,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-04-04 17:50:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:50:34,096 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:50:34,097 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:50:34,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:50:34,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:50:34,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 297. [2019-04-04 17:50:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-04-04 17:50:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-04-04 17:50:34,104 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 107 [2019-04-04 17:50:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:50:34,104 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-04-04 17:50:34,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:50:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-04-04 17:50:34,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-04-04 17:50:34,106 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:34,106 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:34,107 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr104ASSERT_VIOLATIONRTINCONSISTENTforID018_ID020]=== [2019-04-04 17:50:34,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:34,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1230442988, now seen corresponding path program 1 times [2019-04-04 17:50:34,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:34,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:34,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:34,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:34,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:50:34,170 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:50:34,171 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr104ASSERT_VIOLATIONRTINCONSISTENTforID018_ID020 was UNSAFE (26/188) [2019-04-04 17:50:34,171 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:50:34,172 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:50:34,172 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:50:34,172 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:50:34,172 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:50:34,172 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:50:34,172 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:50:34,172 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:50:34,172 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr123ASSERT_VIOLATIONRTINCONSISTENTforID024_ID020======== [2019-04-04 17:50:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:50:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-04-04 17:50:34,176 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:34,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:34,176 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr123ASSERT_VIOLATIONRTINCONSISTENTforID024_ID020]=== [2019-04-04 17:50:34,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:34,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1875271289, now seen corresponding path program 1 times [2019-04-04 17:50:34,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:34,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:34,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:34,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:34,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:50:34,408 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 16 [2019-04-04 17:50:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:50:34,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:50:34,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:50:34,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:50:34,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:50:34,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:50:34,442 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:50:34,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:50:34,720 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:50:34,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:50:34,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-04-04 17:50:34,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:50:34,725 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:50:34,726 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:50:34,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:50:34,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:50:34,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 316. [2019-04-04 17:50:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-04-04 17:50:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2019-04-04 17:50:34,733 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 126 [2019-04-04 17:50:34,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:50:34,733 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2019-04-04 17:50:34,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:50:34,733 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2019-04-04 17:50:34,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-04-04 17:50:34,735 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:50:34,735 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:50:34,737 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr123ASSERT_VIOLATIONRTINCONSISTENTforID024_ID020]=== [2019-04-04 17:50:34,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:50:34,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1716213642, now seen corresponding path program 1 times [2019-04-04 17:50:34,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:50:34,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:50:34,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:34,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:34,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:50:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:50:35,638 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-04-04 17:50:35,851 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:50:35,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:50:35,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:50:35,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:50:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:50:35,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 34 conjunts are in the unsatisfiable core [2019-04-04 17:50:36,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:51:59,382 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 22 [2019-04-04 17:51:59,905 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 40 [2019-04-04 17:52:00,160 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-04-04 17:52:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:00,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:52:00,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-04-04 17:52:00,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-04-04 17:52:00,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-04-04 17:52:00,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-04-04 17:52:00,225 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 10 states. [2019-04-04 17:52:00,359 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-04-04 17:52:00,708 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-04-04 17:52:00,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:52:00,752 INFO L93 Difference]: Finished difference Result 569 states and 569 transitions. [2019-04-04 17:52:00,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-04 17:52:00,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 315 [2019-04-04 17:52:00,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:52:00,759 INFO L225 Difference]: With dead ends: 569 [2019-04-04 17:52:00,759 INFO L226 Difference]: Without dead ends: 569 [2019-04-04 17:52:00,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-04-04 17:52:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-04-04 17:52:00,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 505. [2019-04-04 17:52:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-04-04 17:52:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 505 transitions. [2019-04-04 17:52:00,768 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 505 transitions. Word has length 315 [2019-04-04 17:52:00,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:52:00,769 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 505 transitions. [2019-04-04 17:52:00,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-04-04 17:52:00,769 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 505 transitions. [2019-04-04 17:52:00,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2019-04-04 17:52:00,772 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:00,772 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-04-04 17:52:00,773 INFO L423 AbstractCegarLoop]: === Iteration 3 === [myProcedureErr123ASSERT_VIOLATIONRTINCONSISTENTforID024_ID020]=== [2019-04-04 17:52:00,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:00,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1202092057, now seen corresponding path program 2 times [2019-04-04 17:52:00,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:00,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:00,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:00,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:00,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:02,182 WARN L188 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2019-04-04 17:52:02,955 WARN L188 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2019-04-04 17:52:03,455 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-04-04 17:52:03,694 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 24 [2019-04-04 17:52:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 439 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:03,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:52:03,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:52:03,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:03,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 36 conjunts are in the unsatisfiable core [2019-04-04 17:52:03,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:52:04,113 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-04-04 17:52:04,474 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 22 [2019-04-04 17:52:04,767 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-04-04 17:52:05,290 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2019-04-04 17:52:06,645 WARN L188 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-04-04 17:52:07,317 WARN L188 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-04-04 17:52:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 439 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:07,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:52:07,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-04-04 17:52:07,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-04-04 17:52:07,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-04-04 17:52:07,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-04-04 17:52:07,416 INFO L87 Difference]: Start difference. First operand 505 states and 505 transitions. Second operand 14 states. [2019-04-04 17:52:08,206 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-04-04 17:52:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:52:08,250 INFO L93 Difference]: Finished difference Result 758 states and 758 transitions. [2019-04-04 17:52:08,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-04-04 17:52:08,251 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 504 [2019-04-04 17:52:08,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:52:08,256 INFO L225 Difference]: With dead ends: 758 [2019-04-04 17:52:08,256 INFO L226 Difference]: Without dead ends: 758 [2019-04-04 17:52:08,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-04-04 17:52:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-04-04 17:52:08,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 694. [2019-04-04 17:52:08,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-04-04 17:52:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 694 transitions. [2019-04-04 17:52:08,270 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 694 transitions. Word has length 504 [2019-04-04 17:52:08,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:52:08,270 INFO L480 AbstractCegarLoop]: Abstraction has 694 states and 694 transitions. [2019-04-04 17:52:08,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-04-04 17:52:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 694 transitions. [2019-04-04 17:52:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2019-04-04 17:52:08,275 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:52:08,276 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2019-04-04 17:52:08,276 INFO L423 AbstractCegarLoop]: === Iteration 4 === [myProcedureErr123ASSERT_VIOLATIONRTINCONSISTENTforID024_ID020]=== [2019-04-04 17:52:08,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:52:08,276 INFO L82 PathProgramCache]: Analyzing trace with hash -860987882, now seen corresponding path program 3 times [2019-04-04 17:52:08,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:52:08,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:52:08,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:08,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:08,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:52:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:09,415 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-04-04 17:52:10,157 WARN L188 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2019-04-04 17:52:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 0 proven. 942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:52:10,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:52:10,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:52:10,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:52:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:52:10,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 56 conjunts are in the unsatisfiable core [2019-04-04 17:52:10,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:52:12,770 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 27 [2019-04-04 17:52:13,456 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-04-04 17:52:26,304 WARN L188 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-04-04 17:52:38,992 WARN L188 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-04-04 17:52:39,551 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-04-04 17:53:05,169 WARN L188 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 166 DAG size of output: 59 [2019-04-04 17:53:17,465 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-04-04 17:53:18,017 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-04-04 17:53:19,539 WARN L188 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 34 [2019-04-04 17:53:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 0 proven. 942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:53:19,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:53:19,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 18 [2019-04-04 17:53:19,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-04-04 17:53:19,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-04-04 17:53:19,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=262, Unknown=5, NotChecked=0, Total=380 [2019-04-04 17:53:19,634 INFO L87 Difference]: Start difference. First operand 694 states and 694 transitions. Second operand 20 states. [2019-04-04 17:55:44,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:55:44,028 WARN L549 AbstractCegarLoop]: Verification canceled [2019-04-04 17:55:44,030 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr123ASSERT_VIOLATIONRTINCONSISTENTforID024_ID020 was TIMEOUT (27/188) [2019-04-04 17:55:44,030 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:44,031 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:44,031 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:44,031 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:44,031 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:44,031 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:44,031 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:44,031 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:44,031 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr107ASSERT_VIOLATIONRTINCONSISTENTforID028_ID025======== [2019-04-04 17:55:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-04-04 17:55:44,035 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:44,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:44,035 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr107ASSERT_VIOLATIONRTINCONSISTENTforID028_ID025]=== [2019-04-04 17:55:44,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:44,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1337135479, now seen corresponding path program 1 times [2019-04-04 17:55:44,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:44,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:44,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:44,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:44,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:55:44,052 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:55:44,053 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr107ASSERT_VIOLATIONRTINCONSISTENTforID028_ID025 was UNSAFE (28/188) [2019-04-04 17:55:44,053 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:44,053 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:44,054 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:44,054 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:44,054 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:44,054 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:44,054 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:44,054 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:44,054 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID038_ID033======== [2019-04-04 17:55:44,057 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:44,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-04-04 17:55:44,057 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:44,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:44,057 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID038_ID033]=== [2019-04-04 17:55:44,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:44,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2016364611, now seen corresponding path program 1 times [2019-04-04 17:55:44,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:44,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:44,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:44,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:44,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:55:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:55:44,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:55:44,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:55:44,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:55:44,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:55:44,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:55:44,082 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:55:44,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:55:44,084 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:55:44,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:55:44,084 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-04-04 17:55:44,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:55:44,084 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:55:44,085 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:55:44,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:55:44,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:55:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:55:44,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:55:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:55:44,086 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-04-04 17:55:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:55:44,086 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:55:44,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:55:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:55:44,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:55:44,086 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID038_ID033 was SAFE (29/188) [2019-04-04 17:55:44,087 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:44,087 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:44,087 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:44,087 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:44,088 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:44,088 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:44,088 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:44,088 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:44,088 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr147ASSERT_VIOLATIONRTINCONSISTENTforID022_ID027======== [2019-04-04 17:55:44,090 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:44,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-04-04 17:55:44,091 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:44,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:44,092 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr147ASSERT_VIOLATIONRTINCONSISTENTforID022_ID027]=== [2019-04-04 17:55:44,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:44,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1990408607, now seen corresponding path program 1 times [2019-04-04 17:55:44,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:44,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:44,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:44,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:44,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:55:44,107 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:55:44,108 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr147ASSERT_VIOLATIONRTINCONSISTENTforID022_ID027 was UNSAFE (30/188) [2019-04-04 17:55:44,109 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:44,109 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:44,109 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:44,109 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:44,109 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:44,109 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:44,109 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:44,109 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:44,110 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr158ASSERT_VIOLATIONVACUOUSforID044======== [2019-04-04 17:55:44,112 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:44,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-04-04 17:55:44,113 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:44,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:44,113 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr158ASSERT_VIOLATIONVACUOUSforID044]=== [2019-04-04 17:55:44,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:44,114 INFO L82 PathProgramCache]: Analyzing trace with hash 166429081, now seen corresponding path program 1 times [2019-04-04 17:55:44,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:44,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:44,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:44,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:44,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:55:44,130 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:55:44,131 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr158ASSERT_VIOLATIONVACUOUSforID044 was UNSAFE (31/188) [2019-04-04 17:55:44,131 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:44,132 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:44,132 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:44,132 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:44,132 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:44,132 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:44,132 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:44,132 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:44,132 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr83ASSERT_VIOLATIONRTINCONSISTENTforID031_ID029======== [2019-04-04 17:55:44,135 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:44,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-04-04 17:55:44,135 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:44,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:44,136 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr83ASSERT_VIOLATIONRTINCONSISTENTforID031_ID029]=== [2019-04-04 17:55:44,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:44,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1098319521, now seen corresponding path program 1 times [2019-04-04 17:55:44,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:44,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:44,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:44,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:44,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:55:44,150 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:55:44,151 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr83ASSERT_VIOLATIONRTINCONSISTENTforID031_ID029 was UNSAFE (32/188) [2019-04-04 17:55:44,152 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:44,152 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:44,152 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:44,152 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:44,152 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:44,152 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:44,152 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:44,152 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:44,152 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr84ASSERT_VIOLATIONRTINCONSISTENTforID031_ID030======== [2019-04-04 17:55:44,155 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-04-04 17:55:44,155 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:44,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:44,156 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr84ASSERT_VIOLATIONRTINCONSISTENTforID031_ID030]=== [2019-04-04 17:55:44,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:44,156 INFO L82 PathProgramCache]: Analyzing trace with hash 311834127, now seen corresponding path program 1 times [2019-04-04 17:55:44,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:44,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:44,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:44,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:44,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:55:44,178 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:55:44,179 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr84ASSERT_VIOLATIONRTINCONSISTENTforID031_ID030 was UNSAFE (33/188) [2019-04-04 17:55:44,179 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:44,179 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:44,179 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:44,179 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:44,180 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:44,180 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:44,180 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:44,180 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:44,180 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID015_ID033======== [2019-04-04 17:55:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-04-04 17:55:44,183 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:44,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:44,183 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID015_ID033]=== [2019-04-04 17:55:44,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:44,183 INFO L82 PathProgramCache]: Analyzing trace with hash -944888039, now seen corresponding path program 1 times [2019-04-04 17:55:44,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:44,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:44,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:44,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:44,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:55:44,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:55:44,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:55:44,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:55:44,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:55:44,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:55:44,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:55:44,218 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:55:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:55:44,220 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:55:44,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:55:44,220 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-04-04 17:55:44,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:55:44,220 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:55:44,220 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:55:44,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:55:44,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:55:44,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:55:44,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:55:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:55:44,222 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2019-04-04 17:55:44,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:55:44,222 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:55:44,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:55:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:55:44,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:55:44,223 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID015_ID033 was SAFE (34/188) [2019-04-04 17:55:44,224 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:44,224 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:44,224 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:44,224 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:44,224 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:44,224 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:44,225 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:44,225 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:44,225 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr122ASSERT_VIOLATIONRTINCONSISTENTforID024_ID025======== [2019-04-04 17:55:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:44,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-04-04 17:55:44,228 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:44,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:44,228 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr122ASSERT_VIOLATIONRTINCONSISTENTforID024_ID025]=== [2019-04-04 17:55:44,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:44,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1030323979, now seen corresponding path program 1 times [2019-04-04 17:55:44,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:44,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:44,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:44,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:44,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:55:44,252 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:55:44,253 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr122ASSERT_VIOLATIONRTINCONSISTENTforID024_ID025 was UNSAFE (35/188) [2019-04-04 17:55:44,254 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:44,254 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:44,254 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:44,254 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:44,254 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:44,254 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:44,254 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:44,255 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:44,255 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID043_ID019======== [2019-04-04 17:55:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:44,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-04-04 17:55:44,257 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:44,257 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:44,257 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID043_ID019]=== [2019-04-04 17:55:44,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:44,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1000311609, now seen corresponding path program 1 times [2019-04-04 17:55:44,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:44,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:44,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:44,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:44,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:55:44,527 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-04-04 17:55:44,772 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-04-04 17:55:44,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:55:44,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:55:44,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:55:44,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:55:44,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:55:44,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:55:44,775 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:55:45,011 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-04-04 17:55:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:55:45,268 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:55:45,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:55:45,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-04-04 17:55:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:55:45,271 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:55:45,271 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:55:45,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:55:45,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:55:45,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 205. [2019-04-04 17:55:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-04-04 17:55:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-04-04 17:55:45,276 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 15 [2019-04-04 17:55:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:55:45,276 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-04-04 17:55:45,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:55:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-04-04 17:55:45,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-04-04 17:55:45,277 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:45,278 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:45,278 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID043_ID019]=== [2019-04-04 17:55:45,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:45,278 INFO L82 PathProgramCache]: Analyzing trace with hash 725899704, now seen corresponding path program 1 times [2019-04-04 17:55:45,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:45,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:45,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:45,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:45,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:55:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:55:45,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:55:45,469 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:55:45,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:55:45,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 7 conjunts are in the unsatisfiable core [2019-04-04 17:55:45,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:55:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-04 17:55:45,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:55:45,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2] total 4 [2019-04-04 17:55:45,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-04-04 17:55:45,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-04-04 17:55:45,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-04-04 17:55:45,663 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 6 states. [2019-04-04 17:55:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:55:45,743 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2019-04-04 17:55:45,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:55:45,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2019-04-04 17:55:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:55:45,745 INFO L225 Difference]: With dead ends: 204 [2019-04-04 17:55:45,745 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:55:45,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-04-04 17:55:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:55:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:55:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:55:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:55:45,746 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2019-04-04 17:55:45,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:55:45,746 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:55:45,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-04-04 17:55:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:55:45,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:55:45,747 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID043_ID019 was SAFE (36/188) [2019-04-04 17:55:45,748 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:45,748 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:45,748 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:45,748 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:45,748 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:45,749 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:45,749 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:45,749 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:45,749 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr106ASSERT_VIOLATIONRTINCONSISTENTforID018_ID019======== [2019-04-04 17:55:45,751 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:45,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-04-04 17:55:45,752 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:45,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:45,752 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr106ASSERT_VIOLATIONRTINCONSISTENTforID018_ID019]=== [2019-04-04 17:55:45,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:45,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1428606693, now seen corresponding path program 1 times [2019-04-04 17:55:45,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:45,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:45,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:45,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:45,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:55:46,044 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-04-04 17:55:46,241 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-04-04 17:55:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:55:46,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:55:46,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:55:46,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:55:46,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:55:46,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:55:46,243 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:55:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:55:47,049 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:55:47,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:55:47,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-04-04 17:55:47,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:55:47,051 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:55:47,051 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:55:47,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:55:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:55:47,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 299. [2019-04-04 17:55:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-04-04 17:55:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2019-04-04 17:55:47,059 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 109 [2019-04-04 17:55:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:55:47,059 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2019-04-04 17:55:47,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:55:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2019-04-04 17:55:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-04-04 17:55:47,062 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:47,062 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:47,062 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr106ASSERT_VIOLATIONRTINCONSISTENTforID018_ID019]=== [2019-04-04 17:55:47,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1339674602, now seen corresponding path program 1 times [2019-04-04 17:55:47,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:47,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:47,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:47,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:47,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:55:47,743 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 16 [2019-04-04 17:55:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-04 17:55:47,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:55:47,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:55:47,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:55:47,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 7 conjunts are in the unsatisfiable core [2019-04-04 17:55:47,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:55:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-04 17:55:47,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:55:47,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2019-04-04 17:55:47,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-04-04 17:55:47,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-04-04 17:55:47,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:55:47,988 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 5 states. [2019-04-04 17:55:48,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:55:48,047 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2019-04-04 17:55:48,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:55:48,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 298 [2019-04-04 17:55:48,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:55:48,050 INFO L225 Difference]: With dead ends: 298 [2019-04-04 17:55:48,050 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:55:48,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-04-04 17:55:48,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:55:48,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:55:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:55:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:55:48,055 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 298 [2019-04-04 17:55:48,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:55:48,055 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:55:48,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-04-04 17:55:48,055 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:55:48,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:55:48,056 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr106ASSERT_VIOLATIONRTINCONSISTENTforID018_ID019 was SAFE (37/188) [2019-04-04 17:55:48,056 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:48,056 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:48,056 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:48,057 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:48,057 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:48,057 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:48,057 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:48,057 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:48,057 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr167ASSERT_VIOLATIONVACUOUSforID042======== [2019-04-04 17:55:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:48,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-04-04 17:55:48,065 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:48,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:48,065 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr167ASSERT_VIOLATIONVACUOUSforID042]=== [2019-04-04 17:55:48,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:48,066 INFO L82 PathProgramCache]: Analyzing trace with hash 9108915, now seen corresponding path program 1 times [2019-04-04 17:55:48,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:48,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:48,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:48,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:55:48,084 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:55:48,085 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr167ASSERT_VIOLATIONVACUOUSforID042 was UNSAFE (38/188) [2019-04-04 17:55:48,085 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:48,086 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:48,086 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:48,086 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:48,086 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:48,086 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:48,086 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:48,086 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:48,086 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID041_ID025======== [2019-04-04 17:55:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-04-04 17:55:48,089 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:48,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-04-04 17:55:48,089 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID041_ID025]=== [2019-04-04 17:55:48,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:48,089 INFO L82 PathProgramCache]: Analyzing trace with hash 702884111, now seen corresponding path program 1 times [2019-04-04 17:55:48,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:48,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:48,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:48,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:55:48,107 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:55:48,108 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID041_ID025 was UNSAFE (39/188) [2019-04-04 17:55:48,108 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:48,108 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:48,108 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:48,108 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:48,108 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:48,108 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:48,109 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:48,109 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:48,109 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr52ASSERT_VIOLATIONRTINCONSISTENTforID017_ID033======== [2019-04-04 17:55:48,111 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:48,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-04-04 17:55:48,111 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:48,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:48,112 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr52ASSERT_VIOLATIONRTINCONSISTENTforID017_ID033]=== [2019-04-04 17:55:48,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:48,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1212984849, now seen corresponding path program 1 times [2019-04-04 17:55:48,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:48,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:48,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:48,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:55:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:55:48,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:55:48,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:55:48,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:55:48,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:55:48,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:55:48,139 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:55:48,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:55:48,141 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:55:48,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:55:48,141 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 55 [2019-04-04 17:55:48,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:55:48,142 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:55:48,142 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:55:48,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:55:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:55:48,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:55:48,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:55:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:55:48,143 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2019-04-04 17:55:48,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:55:48,143 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:55:48,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:55:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:55:48,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:55:48,144 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr52ASSERT_VIOLATIONRTINCONSISTENTforID017_ID033 was SAFE (40/188) [2019-04-04 17:55:48,144 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:48,144 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:48,144 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:48,144 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:48,144 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:48,144 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:48,145 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:48,145 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:48,145 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr77ASSERT_VIOLATIONRTINCONSISTENTforID032_ID025======== [2019-04-04 17:55:48,147 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:48,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-04-04 17:55:48,148 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:48,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:48,148 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr77ASSERT_VIOLATIONRTINCONSISTENTforID032_ID025]=== [2019-04-04 17:55:48,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:48,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1020618585, now seen corresponding path program 1 times [2019-04-04 17:55:48,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:48,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:48,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:48,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:55:48,163 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:55:48,164 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr77ASSERT_VIOLATIONRTINCONSISTENTforID032_ID025 was UNSAFE (41/188) [2019-04-04 17:55:48,165 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:48,165 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:48,165 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:48,165 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:48,165 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:48,165 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:48,165 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:48,165 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:48,165 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr186ASSERT_VIOLATIONVACUOUSforID019======== [2019-04-04 17:55:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-04-04 17:55:48,171 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:48,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:48,171 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr186ASSERT_VIOLATIONVACUOUSforID019]=== [2019-04-04 17:55:48,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:48,171 INFO L82 PathProgramCache]: Analyzing trace with hash 377571637, now seen corresponding path program 1 times [2019-04-04 17:55:48,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:48,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:48,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:48,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:55:48,186 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:55:48,187 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr186ASSERT_VIOLATIONVACUOUSforID019 was UNSAFE (42/188) [2019-04-04 17:55:48,187 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:48,188 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:48,189 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:48,189 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:48,189 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:48,189 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:48,189 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:48,189 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:48,189 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID043_ID020======== [2019-04-04 17:55:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:48,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-04-04 17:55:48,192 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:48,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:48,192 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID043_ID020]=== [2019-04-04 17:55:48,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:48,193 INFO L82 PathProgramCache]: Analyzing trace with hash 696164997, now seen corresponding path program 1 times [2019-04-04 17:55:48,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:48,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:48,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:48,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:55:48,207 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:55:48,208 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID043_ID020 was UNSAFE (43/188) [2019-04-04 17:55:48,208 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:48,208 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:48,208 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:48,208 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:48,208 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:48,209 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:48,209 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:48,209 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:48,210 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr101ASSERT_VIOLATIONRTINCONSISTENTforID042_ID027======== [2019-04-04 17:55:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:48,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-04-04 17:55:48,213 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:48,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:48,213 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr101ASSERT_VIOLATIONRTINCONSISTENTforID042_ID027]=== [2019-04-04 17:55:48,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:48,213 INFO L82 PathProgramCache]: Analyzing trace with hash -371171471, now seen corresponding path program 1 times [2019-04-04 17:55:48,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:48,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:48,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:48,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:55:48,229 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:55:48,230 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr101ASSERT_VIOLATIONRTINCONSISTENTforID042_ID027 was UNSAFE (44/188) [2019-04-04 17:55:48,230 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:48,230 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:48,231 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:48,231 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:48,231 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:48,231 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:48,231 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:48,231 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:48,231 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr70ASSERT_VIOLATIONRTINCONSISTENTforID047_ID042======== [2019-04-04 17:55:48,234 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-04-04 17:55:48,235 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:48,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:48,235 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr70ASSERT_VIOLATIONRTINCONSISTENTforID047_ID042]=== [2019-04-04 17:55:48,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:48,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1993003455, now seen corresponding path program 1 times [2019-04-04 17:55:48,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:48,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:48,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:48,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:55:48,254 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:55:48,254 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr70ASSERT_VIOLATIONRTINCONSISTENTforID047_ID042 was UNSAFE (45/188) [2019-04-04 17:55:48,254 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:48,255 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:48,255 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:48,255 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:48,255 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:48,255 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:48,255 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:48,255 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:48,255 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr160ASSERT_VIOLATIONVACUOUSforID037======== [2019-04-04 17:55:48,258 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-04-04 17:55:48,259 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:48,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:48,259 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr160ASSERT_VIOLATIONVACUOUSforID037]=== [2019-04-04 17:55:48,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:48,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1024590811, now seen corresponding path program 1 times [2019-04-04 17:55:48,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:48,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:48,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:48,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:55:48,444 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-04-04 17:55:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:55:48,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:55:48,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:55:48,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 17:55:48,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 17:55:48,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:55:48,446 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 3 states. [2019-04-04 17:55:48,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:55:48,553 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:55:48,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 17:55:48,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-04-04 17:55:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:55:48,556 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:55:48,556 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:55:48,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:55:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:55:48,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 353. [2019-04-04 17:55:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-04-04 17:55:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-04-04 17:55:48,562 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 163 [2019-04-04 17:55:48,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:55:48,562 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-04-04 17:55:48,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 17:55:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-04-04 17:55:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-04-04 17:55:48,564 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:48,565 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:48,565 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr160ASSERT_VIOLATIONVACUOUSforID037]=== [2019-04-04 17:55:48,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:48,565 INFO L82 PathProgramCache]: Analyzing trace with hash -532482484, now seen corresponding path program 1 times [2019-04-04 17:55:48,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:48,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:48,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:48,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:55:48,612 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:55:48,613 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr160ASSERT_VIOLATIONVACUOUSforID037 was UNSAFE (46/188) [2019-04-04 17:55:48,614 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:48,614 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:48,614 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:48,614 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:48,614 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:48,614 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:48,614 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:48,614 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:48,614 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr63ASSERT_VIOLATIONRTINCONSISTENTforID045_ID031======== [2019-04-04 17:55:48,617 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:48,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-04-04 17:55:48,618 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:48,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:48,618 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr63ASSERT_VIOLATIONRTINCONSISTENTforID045_ID031]=== [2019-04-04 17:55:48,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:48,619 INFO L82 PathProgramCache]: Analyzing trace with hash 131093835, now seen corresponding path program 1 times [2019-04-04 17:55:48,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:48,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:48,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:48,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:55:48,632 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:55:48,633 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr63ASSERT_VIOLATIONRTINCONSISTENTforID045_ID031 was UNSAFE (47/188) [2019-04-04 17:55:48,633 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:55:48,633 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:55:48,633 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:55:48,634 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:55:48,634 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:55:48,634 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:55:48,634 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:55:48,634 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:55:48,634 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr37ASSERT_VIOLATIONRTINCONSISTENTforID044_ID022======== [2019-04-04 17:55:48,637 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:55:48,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-04-04 17:55:48,637 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:48,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:48,637 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr37ASSERT_VIOLATIONRTINCONSISTENTforID044_ID022]=== [2019-04-04 17:55:48,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:48,638 INFO L82 PathProgramCache]: Analyzing trace with hash -286449871, now seen corresponding path program 1 times [2019-04-04 17:55:48,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:48,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:48,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:48,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:55:48,822 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-04-04 17:55:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:55:48,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:55:48,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:55:48,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:55:48,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:55:48,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:55:48,858 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:55:49,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:55:49,109 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:55:49,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:55:49,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-04-04 17:55:49,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:55:49,112 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:55:49,112 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:55:49,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:55:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:55:49,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 230. [2019-04-04 17:55:49,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-04-04 17:55:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2019-04-04 17:55:49,117 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 40 [2019-04-04 17:55:49,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:55:49,117 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2019-04-04 17:55:49,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:55:49,118 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2019-04-04 17:55:49,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-04-04 17:55:49,120 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:49,120 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:55:49,121 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr37ASSERT_VIOLATIONRTINCONSISTENTforID044_ID022]=== [2019-04-04 17:55:49,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:49,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1225325408, now seen corresponding path program 1 times [2019-04-04 17:55:49,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:49,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:49,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:49,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:49,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:55:49,510 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-04-04 17:55:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:55:49,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:55:49,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:55:49,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:55:49,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 27 conjunts are in the unsatisfiable core [2019-04-04 17:55:49,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:55:51,752 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 122 DAG size of output: 50 [2019-04-04 17:55:52,226 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 26 [2019-04-04 17:55:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:55:52,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:55:52,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-04-04 17:55:52,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-04-04 17:55:52,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-04-04 17:55:52,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-04-04 17:55:52,254 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 10 states. [2019-04-04 17:55:52,413 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-04-04 17:55:53,279 WARN L188 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-04-04 17:55:53,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:55:53,326 INFO L93 Difference]: Finished difference Result 569 states and 569 transitions. [2019-04-04 17:55:53,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-04 17:55:53,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 229 [2019-04-04 17:55:53,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:55:53,329 INFO L225 Difference]: With dead ends: 569 [2019-04-04 17:55:53,329 INFO L226 Difference]: Without dead ends: 569 [2019-04-04 17:55:53,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-04-04 17:55:53,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-04-04 17:55:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 419. [2019-04-04 17:55:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-04-04 17:55:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 419 transitions. [2019-04-04 17:55:53,336 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 419 transitions. Word has length 229 [2019-04-04 17:55:53,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:55:53,336 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 419 transitions. [2019-04-04 17:55:53,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-04-04 17:55:53,336 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 419 transitions. [2019-04-04 17:55:53,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-04-04 17:55:53,338 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:55:53,339 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-04-04 17:55:53,339 INFO L423 AbstractCegarLoop]: === Iteration 3 === [myProcedureErr37ASSERT_VIOLATIONRTINCONSISTENTforID044_ID022]=== [2019-04-04 17:55:53,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:55:53,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1201474961, now seen corresponding path program 2 times [2019-04-04 17:55:53,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:55:53,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:55:53,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:53,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:53,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:55:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:55:53,834 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-04-04 17:55:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:55:54,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:55:54,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:55:54,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:55:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:55:54,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 35 conjunts are in the unsatisfiable core [2019-04-04 17:55:54,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:55:54,755 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-04-04 17:55:56,266 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2019-04-04 17:55:56,304 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-04-04 17:55:56,373 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 10368 conjuctions. This might take some time... [2019-04-04 17:56:08,750 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 10368 conjuctions. [2019-04-04 17:56:08,776 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-04-04 17:56:08,794 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 6272 conjuctions. This might take some time... [2019-04-04 17:56:13,299 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 6272 conjuctions. [2019-04-04 17:56:13,943 WARN L188 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-04-04 17:56:15,467 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-04-04 17:56:26,931 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 11760 conjuctions. This might take some time... [2019-04-04 17:56:39,436 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 11760 conjuctions. [2019-04-04 17:56:39,519 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 12960 conjuctions. This might take some time... [2019-04-04 17:56:57,312 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 12960 conjuctions. [2019-04-04 17:57:02,033 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-04-04 17:57:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 266 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-04 17:57:02,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:57:02,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2019-04-04 17:57:02,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-04-04 17:57:02,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-04-04 17:57:02,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-04-04 17:57:02,066 INFO L87 Difference]: Start difference. First operand 419 states and 419 transitions. Second operand 13 states. [2019-04-04 17:57:02,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:02,190 INFO L93 Difference]: Finished difference Result 418 states and 418 transitions. [2019-04-04 17:57:02,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-04 17:57:02,190 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 418 [2019-04-04 17:57:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:02,191 INFO L225 Difference]: With dead ends: 418 [2019-04-04 17:57:02,191 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:02,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-04-04 17:57:02,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:02,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:02,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:02,193 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 418 [2019-04-04 17:57:02,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:02,193 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:02,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-04-04 17:57:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:02,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:02,194 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr37ASSERT_VIOLATIONRTINCONSISTENTforID044_ID022 was SAFE (48/188) [2019-04-04 17:57:02,195 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:02,195 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:02,195 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:02,195 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:02,195 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:02,196 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:02,196 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:02,196 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:02,196 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr113ASSERT_VIOLATIONRTINCONSISTENTforID029_ID033======== [2019-04-04 17:57:02,198 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:02,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-04-04 17:57:02,199 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:02,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:02,199 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr113ASSERT_VIOLATIONRTINCONSISTENTforID029_ID033]=== [2019-04-04 17:57:02,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:02,199 INFO L82 PathProgramCache]: Analyzing trace with hash -137983107, now seen corresponding path program 1 times [2019-04-04 17:57:02,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:02,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:02,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:02,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:02,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:02,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:02,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:02,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:57:02,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:57:02,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:02,226 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:57:02,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:02,228 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:57:02,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:57:02,228 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 116 [2019-04-04 17:57:02,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:02,229 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:57:02,229 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:02,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:02,230 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2019-04-04 17:57:02,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:02,230 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:02,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:57:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:02,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:02,230 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr113ASSERT_VIOLATIONRTINCONSISTENTforID029_ID033 was SAFE (49/188) [2019-04-04 17:57:02,231 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:02,231 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:02,231 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:02,231 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:02,231 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:02,231 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:02,231 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:02,232 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:02,232 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr27ASSERT_VIOLATIONRTINCONSISTENTforID044_ID047======== [2019-04-04 17:57:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:02,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-04-04 17:57:02,234 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:02,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:02,234 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr27ASSERT_VIOLATIONRTINCONSISTENTforID044_ID047]=== [2019-04-04 17:57:02,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:02,234 INFO L82 PathProgramCache]: Analyzing trace with hash 269500711, now seen corresponding path program 1 times [2019-04-04 17:57:02,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:02,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:02,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:02,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:02,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:02,247 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:02,247 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr27ASSERT_VIOLATIONRTINCONSISTENTforID044_ID047 was UNSAFE (50/188) [2019-04-04 17:57:02,248 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:02,248 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:02,248 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:02,248 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:02,248 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:02,248 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:02,248 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:02,249 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:02,249 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr34ASSERT_VIOLATIONRTINCONSISTENTforID044_ID024======== [2019-04-04 17:57:02,251 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:02,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-04-04 17:57:02,251 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:02,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:02,252 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr34ASSERT_VIOLATIONRTINCONSISTENTforID044_ID024]=== [2019-04-04 17:57:02,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:02,252 INFO L82 PathProgramCache]: Analyzing trace with hash 638807453, now seen corresponding path program 1 times [2019-04-04 17:57:02,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:02,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:02,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:02,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:02,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:02,440 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-04-04 17:57:02,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:02,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:02,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:57:02,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:57:02,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:57:02,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:57:02,473 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:57:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:02,708 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:57:02,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:57:02,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-04-04 17:57:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:02,710 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:57:02,711 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:57:02,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:57:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:57:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 227. [2019-04-04 17:57:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-04-04 17:57:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2019-04-04 17:57:02,716 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 37 [2019-04-04 17:57:02,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:02,716 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2019-04-04 17:57:02,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:57:02,716 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2019-04-04 17:57:02,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-04-04 17:57:02,717 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:02,718 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:02,718 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr34ASSERT_VIOLATIONRTINCONSISTENTforID044_ID024]=== [2019-04-04 17:57:02,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:02,718 INFO L82 PathProgramCache]: Analyzing trace with hash -169502770, now seen corresponding path program 1 times [2019-04-04 17:57:02,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:02,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:02,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:02,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:02,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:03,121 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-04-04 17:57:03,338 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-04-04 17:57:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:03,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:57:03,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:57:03,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:03,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 11 conjunts are in the unsatisfiable core [2019-04-04 17:57:03,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:57:03,951 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-04-04 17:57:04,358 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 25 [2019-04-04 17:57:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:04,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:57:04,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-04-04 17:57:04,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-04-04 17:57:04,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-04-04 17:57:04,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-04-04 17:57:04,385 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 10 states. [2019-04-04 17:57:04,740 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-04-04 17:57:04,941 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-04-04 17:57:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:04,985 INFO L93 Difference]: Finished difference Result 569 states and 569 transitions. [2019-04-04 17:57:04,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-04 17:57:04,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 226 [2019-04-04 17:57:04,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:04,988 INFO L225 Difference]: With dead ends: 569 [2019-04-04 17:57:04,989 INFO L226 Difference]: Without dead ends: 569 [2019-04-04 17:57:04,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-04-04 17:57:04,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-04-04 17:57:04,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 416. [2019-04-04 17:57:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-04-04 17:57:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2019-04-04 17:57:04,996 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 226 [2019-04-04 17:57:04,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:04,996 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2019-04-04 17:57:04,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-04-04 17:57:04,996 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2019-04-04 17:57:04,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-04-04 17:57:04,999 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:04,999 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-04-04 17:57:05,000 INFO L423 AbstractCegarLoop]: === Iteration 3 === [myProcedureErr34ASSERT_VIOLATIONRTINCONSISTENTforID044_ID024]=== [2019-04-04 17:57:05,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:05,000 INFO L82 PathProgramCache]: Analyzing trace with hash 724638525, now seen corresponding path program 2 times [2019-04-04 17:57:05,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:05,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:05,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:05,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:05,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:05,774 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-04-04 17:57:05,971 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2019-04-04 17:57:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:06,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:57:06,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:57:06,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:06,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 16 conjunts are in the unsatisfiable core [2019-04-04 17:57:06,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:57:06,561 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 19 [2019-04-04 17:57:06,779 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-04-04 17:57:07,083 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 20 [2019-04-04 17:57:07,553 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 25 [2019-04-04 17:57:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-04 17:57:07,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:57:07,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-04-04 17:57:07,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-04-04 17:57:07,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-04-04 17:57:07,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-04-04 17:57:07,583 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 12 states. [2019-04-04 17:57:07,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:07,812 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2019-04-04 17:57:07,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-04 17:57:07,812 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 415 [2019-04-04 17:57:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:07,813 INFO L225 Difference]: With dead ends: 415 [2019-04-04 17:57:07,813 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:07,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 409 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-04-04 17:57:07,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:07,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:07,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:07,814 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 415 [2019-04-04 17:57:07,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:07,814 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:07,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-04-04 17:57:07,815 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:07,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:07,815 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr34ASSERT_VIOLATIONRTINCONSISTENTforID044_ID024 was SAFE (51/188) [2019-04-04 17:57:07,815 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:07,816 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:07,816 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:07,816 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:07,816 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:07,816 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:07,816 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:07,816 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:07,816 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr172ASSERT_VIOLATIONVACUOUSforID000======== [2019-04-04 17:57:07,818 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:07,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-04-04 17:57:07,820 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:07,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:07,820 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr172ASSERT_VIOLATIONVACUOUSforID000]=== [2019-04-04 17:57:07,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:07,820 INFO L82 PathProgramCache]: Analyzing trace with hash -292492953, now seen corresponding path program 1 times [2019-04-04 17:57:07,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:07,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:07,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:07,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:07,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:07,834 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:07,834 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr172ASSERT_VIOLATIONVACUOUSforID000 was UNSAFE (52/188) [2019-04-04 17:57:07,835 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:07,835 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:07,835 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:07,835 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:07,835 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:07,835 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:07,836 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:07,836 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:07,836 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr103ASSERT_VIOLATIONRTINCONSISTENTforID018_ID025======== [2019-04-04 17:57:07,838 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:07,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-04-04 17:57:07,839 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:07,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:07,839 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr103ASSERT_VIOLATIONRTINCONSISTENTforID018_ID025]=== [2019-04-04 17:57:07,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:07,839 INFO L82 PathProgramCache]: Analyzing trace with hash -213467789, now seen corresponding path program 1 times [2019-04-04 17:57:07,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:07,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:07,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:07,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:07,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:07,855 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:07,855 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr103ASSERT_VIOLATIONRTINCONSISTENTforID018_ID025 was UNSAFE (53/188) [2019-04-04 17:57:07,856 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:07,856 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:07,856 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:07,856 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:07,856 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:07,856 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:07,856 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:07,857 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:07,857 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr20ASSERT_VIOLATIONRTINCONSISTENTforID040_ID020======== [2019-04-04 17:57:07,859 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:07,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-04-04 17:57:07,859 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:07,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:07,859 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr20ASSERT_VIOLATIONRTINCONSISTENTforID040_ID020]=== [2019-04-04 17:57:07,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:07,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1186435633, now seen corresponding path program 1 times [2019-04-04 17:57:07,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:07,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:07,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:07,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:07,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:07,875 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:07,875 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr20ASSERT_VIOLATIONRTINCONSISTENTforID040_ID020 was UNSAFE (54/188) [2019-04-04 17:57:07,875 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:07,876 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:07,876 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:07,876 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:07,876 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:07,876 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:07,876 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:07,876 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:07,876 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr66ASSERT_VIOLATIONRTINCONSISTENTforID045_ID033======== [2019-04-04 17:57:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:07,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-04-04 17:57:07,879 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:07,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:07,879 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr66ASSERT_VIOLATIONRTINCONSISTENTforID045_ID033]=== [2019-04-04 17:57:07,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:07,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1292030397, now seen corresponding path program 1 times [2019-04-04 17:57:07,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:07,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:07,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:07,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:07,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:07,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:07,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:07,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:57:07,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:57:07,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:07,905 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:57:07,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:07,906 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:57:07,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:57:07,906 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 69 [2019-04-04 17:57:07,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:07,907 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:57:07,907 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:07,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:07,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:07,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:07,908 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2019-04-04 17:57:07,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:07,908 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:07,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:57:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:07,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:07,909 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr66ASSERT_VIOLATIONRTINCONSISTENTforID045_ID033 was SAFE (55/188) [2019-04-04 17:57:07,909 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:07,909 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:07,909 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:07,909 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:07,909 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:07,909 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:07,910 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:07,910 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:07,910 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr110ASSERT_VIOLATIONRTINCONSISTENTforID028_ID019======== [2019-04-04 17:57:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:07,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-04-04 17:57:07,913 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:07,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:07,913 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr110ASSERT_VIOLATIONRTINCONSISTENTforID028_ID019]=== [2019-04-04 17:57:07,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:07,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1217664151, now seen corresponding path program 1 times [2019-04-04 17:57:07,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:07,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:07,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:07,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:07,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:08,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:08,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:57:08,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:57:08,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:57:08,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:57:08,077 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:57:08,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:08,243 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:57:08,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:57:08,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-04-04 17:57:08,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:08,246 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:57:08,246 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:57:08,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:57:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:57:08,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 303. [2019-04-04 17:57:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-04-04 17:57:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2019-04-04 17:57:08,253 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 113 [2019-04-04 17:57:08,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:08,253 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2019-04-04 17:57:08,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:57:08,253 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2019-04-04 17:57:08,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-04-04 17:57:08,254 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:08,255 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:08,255 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr110ASSERT_VIOLATIONRTINCONSISTENTforID028_ID019]=== [2019-04-04 17:57:08,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:08,255 INFO L82 PathProgramCache]: Analyzing trace with hash -729461734, now seen corresponding path program 1 times [2019-04-04 17:57:08,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:08,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:08,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:08,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:08,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:08,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:57:08,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:57:08,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:08,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 7 conjunts are in the unsatisfiable core [2019-04-04 17:57:08,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:57:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-04 17:57:08,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:57:08,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2] total 4 [2019-04-04 17:57:08,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-04-04 17:57:08,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-04-04 17:57:08,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-04-04 17:57:08,596 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 6 states. [2019-04-04 17:57:08,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:08,651 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2019-04-04 17:57:08,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:57:08,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 302 [2019-04-04 17:57:08,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:08,653 INFO L225 Difference]: With dead ends: 302 [2019-04-04 17:57:08,653 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:08,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-04-04 17:57:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:08,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:08,654 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 302 [2019-04-04 17:57:08,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:08,654 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:08,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-04-04 17:57:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:08,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:08,655 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr110ASSERT_VIOLATIONRTINCONSISTENTforID028_ID019 was SAFE (56/188) [2019-04-04 17:57:08,655 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:08,655 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:08,655 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:08,655 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:08,655 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:08,655 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:08,655 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:08,655 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:08,655 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr89ASSERT_VIOLATIONRTINCONSISTENTforID031_ID022======== [2019-04-04 17:57:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:08,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-04-04 17:57:08,658 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:08,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:08,658 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr89ASSERT_VIOLATIONRTINCONSISTENTforID031_ID022]=== [2019-04-04 17:57:08,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:08,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1907010715, now seen corresponding path program 1 times [2019-04-04 17:57:08,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:08,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:08,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:08,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:08,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:08,672 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:08,673 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr89ASSERT_VIOLATIONRTINCONSISTENTforID031_ID022 was UNSAFE (57/188) [2019-04-04 17:57:08,673 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:08,673 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:08,673 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:08,673 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:08,674 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:08,674 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:08,674 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:08,674 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:08,674 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr168ASSERT_VIOLATIONVACUOUSforID018======== [2019-04-04 17:57:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:08,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-04-04 17:57:08,677 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:08,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:08,677 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr168ASSERT_VIOLATIONVACUOUSforID018]=== [2019-04-04 17:57:08,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:08,677 INFO L82 PathProgramCache]: Analyzing trace with hash 282377443, now seen corresponding path program 1 times [2019-04-04 17:57:08,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:08,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:08,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:08,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:08,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:08,692 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:08,692 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr168ASSERT_VIOLATIONVACUOUSforID018 was UNSAFE (58/188) [2019-04-04 17:57:08,693 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:08,693 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:08,693 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:08,693 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:08,693 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:08,693 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:08,694 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:08,694 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:08,694 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr62ASSERT_VIOLATIONRTINCONSISTENTforID046_ID019======== [2019-04-04 17:57:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-04-04 17:57:08,696 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:08,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:08,696 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr62ASSERT_VIOLATIONRTINCONSISTENTforID046_ID019]=== [2019-04-04 17:57:08,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:08,696 INFO L82 PathProgramCache]: Analyzing trace with hash -411413191, now seen corresponding path program 1 times [2019-04-04 17:57:08,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:08,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:08,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:08,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:08,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:09,003 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-04-04 17:57:09,271 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-04-04 17:57:09,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:09,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:09,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:57:09,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:57:09,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:57:09,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:57:09,272 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:57:09,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:09,477 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:57:09,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:57:09,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-04-04 17:57:09,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:09,480 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:57:09,481 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:57:09,481 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-04 17:57:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:57:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 255. [2019-04-04 17:57:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-04-04 17:57:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2019-04-04 17:57:09,486 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 65 [2019-04-04 17:57:09,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:09,486 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2019-04-04 17:57:09,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:57:09,486 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2019-04-04 17:57:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-04-04 17:57:09,487 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:09,488 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:09,488 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr62ASSERT_VIOLATIONRTINCONSISTENTforID046_ID019]=== [2019-04-04 17:57:09,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:09,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1407960086, now seen corresponding path program 1 times [2019-04-04 17:57:09,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:09,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:09,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:09,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:09,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:09,863 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-04-04 17:57:10,116 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2019-04-04 17:57:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:10,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:57:10,180 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:57:10,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:10,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 23 conjunts are in the unsatisfiable core [2019-04-04 17:57:10,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:57:10,681 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-04-04 17:57:12,665 WARN L188 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 118 DAG size of output: 46 [2019-04-04 17:57:13,643 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2019-04-04 17:57:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:13,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:57:13,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-04-04 17:57:13,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-04-04 17:57:13,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-04-04 17:57:13,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-04-04 17:57:13,672 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 10 states. [2019-04-04 17:57:13,797 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-04-04 17:57:14,366 WARN L188 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-04-04 17:57:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:14,411 INFO L93 Difference]: Finished difference Result 569 states and 569 transitions. [2019-04-04 17:57:14,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-04 17:57:14,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 254 [2019-04-04 17:57:14,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:14,413 INFO L225 Difference]: With dead ends: 569 [2019-04-04 17:57:14,414 INFO L226 Difference]: Without dead ends: 569 [2019-04-04 17:57:14,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-04-04 17:57:14,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-04-04 17:57:14,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 444. [2019-04-04 17:57:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-04-04 17:57:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 444 transitions. [2019-04-04 17:57:14,421 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 444 transitions. Word has length 254 [2019-04-04 17:57:14,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:14,422 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 444 transitions. [2019-04-04 17:57:14,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-04-04 17:57:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 444 transitions. [2019-04-04 17:57:14,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-04-04 17:57:14,424 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:14,424 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-04-04 17:57:14,425 INFO L423 AbstractCegarLoop]: === Iteration 3 === [myProcedureErr62ASSERT_VIOLATIONRTINCONSISTENTforID046_ID019]=== [2019-04-04 17:57:14,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:14,425 INFO L82 PathProgramCache]: Analyzing trace with hash 510743257, now seen corresponding path program 2 times [2019-04-04 17:57:14,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:14,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:14,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:14,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:14,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 317 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:15,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:57:15,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:57:15,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:15,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 21 conjunts are in the unsatisfiable core [2019-04-04 17:57:15,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:57:15,738 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2019-04-04 17:57:15,884 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-04-04 17:57:16,142 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2019-04-04 17:57:16,152 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-04 17:57:16,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:57:16,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2019-04-04 17:57:16,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-04-04 17:57:16,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-04-04 17:57:16,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-04-04 17:57:16,172 INFO L87 Difference]: Start difference. First operand 444 states and 444 transitions. Second operand 13 states. [2019-04-04 17:57:16,432 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-04-04 17:57:16,615 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-04-04 17:57:16,794 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-04-04 17:57:16,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:16,799 INFO L93 Difference]: Finished difference Result 568 states and 568 transitions. [2019-04-04 17:57:16,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-04-04 17:57:16,800 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 443 [2019-04-04 17:57:16,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:16,800 INFO L225 Difference]: With dead ends: 568 [2019-04-04 17:57:16,800 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:16,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 436 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-04-04 17:57:16,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:16,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:16,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:16,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:16,801 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 443 [2019-04-04 17:57:16,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:16,801 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:16,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-04-04 17:57:16,801 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:16,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:16,802 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr62ASSERT_VIOLATIONRTINCONSISTENTforID046_ID019 was SAFE (59/188) [2019-04-04 17:57:16,802 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:16,802 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:16,802 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:16,803 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:16,803 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:16,803 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:16,803 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:16,803 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:16,803 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr64ASSERT_VIOLATIONRTINCONSISTENTforID045_ID020======== [2019-04-04 17:57:16,805 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:16,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-04-04 17:57:16,805 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:16,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:16,805 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr64ASSERT_VIOLATIONRTINCONSISTENTforID045_ID020]=== [2019-04-04 17:57:16,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:16,806 INFO L82 PathProgramCache]: Analyzing trace with hash -231057541, now seen corresponding path program 1 times [2019-04-04 17:57:16,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:16,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:16,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:16,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:16,817 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:16,818 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr64ASSERT_VIOLATIONRTINCONSISTENTforID045_ID020 was UNSAFE (60/188) [2019-04-04 17:57:16,818 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:16,818 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:16,818 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:16,819 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:16,819 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:16,819 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:16,819 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:16,819 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:16,819 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr93ASSERT_VIOLATIONRTINCONSISTENTforID042_ID028======== [2019-04-04 17:57:16,821 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:16,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-04-04 17:57:16,821 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:16,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:16,822 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr93ASSERT_VIOLATIONRTINCONSISTENTforID042_ID028]=== [2019-04-04 17:57:16,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:16,822 INFO L82 PathProgramCache]: Analyzing trace with hash -189515927, now seen corresponding path program 1 times [2019-04-04 17:57:16,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:16,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:16,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:16,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:16,835 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:16,836 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr93ASSERT_VIOLATIONRTINCONSISTENTforID042_ID028 was UNSAFE (61/188) [2019-04-04 17:57:16,836 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:16,836 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:16,837 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:16,837 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:16,837 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:16,837 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:16,837 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:16,837 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:16,837 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr157ASSERT_VIOLATIONVACUOUSforID040======== [2019-04-04 17:57:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-04-04 17:57:16,840 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:16,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:16,840 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr157ASSERT_VIOLATIONVACUOUSforID040]=== [2019-04-04 17:57:16,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:16,841 INFO L82 PathProgramCache]: Analyzing trace with hash -964462679, now seen corresponding path program 1 times [2019-04-04 17:57:16,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:16,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:16,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:16,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:16,854 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:16,855 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr157ASSERT_VIOLATIONVACUOUSforID040 was UNSAFE (62/188) [2019-04-04 17:57:16,855 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:16,855 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:16,855 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:16,855 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:16,856 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:16,856 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:16,856 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:16,856 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:16,856 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr45ASSERT_VIOLATIONRTINCONSISTENTforID021_ID033======== [2019-04-04 17:57:16,857 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:16,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-04-04 17:57:16,858 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:16,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:16,858 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr45ASSERT_VIOLATIONRTINCONSISTENTforID021_ID033]=== [2019-04-04 17:57:16,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:16,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1694353209, now seen corresponding path program 1 times [2019-04-04 17:57:16,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:16,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:16,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:16,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:16,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:16,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:16,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:57:16,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:57:16,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:16,881 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:57:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:16,883 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:57:16,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:57:16,883 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 48 [2019-04-04 17:57:16,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:16,883 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:57:16,883 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:16,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:16,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:16,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:16,884 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2019-04-04 17:57:16,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:16,884 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:16,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:57:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:16,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:16,885 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr45ASSERT_VIOLATIONRTINCONSISTENTforID021_ID033 was SAFE (63/188) [2019-04-04 17:57:16,885 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:16,886 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:16,886 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:16,886 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:16,886 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:16,886 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:16,886 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:16,886 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:16,886 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr165ASSERT_VIOLATIONVACUOUSforID032======== [2019-04-04 17:57:16,888 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:16,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-04-04 17:57:16,889 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:16,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:16,889 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr165ASSERT_VIOLATIONVACUOUSforID032]=== [2019-04-04 17:57:16,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:16,889 INFO L82 PathProgramCache]: Analyzing trace with hash -286023759, now seen corresponding path program 1 times [2019-04-04 17:57:16,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:16,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:16,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:16,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:16,903 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:16,904 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr165ASSERT_VIOLATIONVACUOUSforID032 was UNSAFE (64/188) [2019-04-04 17:57:16,904 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:16,904 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:16,904 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:16,904 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:16,904 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:16,904 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:16,905 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:16,905 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:16,905 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr163ASSERT_VIOLATIONVACUOUSforID045======== [2019-04-04 17:57:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-04-04 17:57:16,907 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:16,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:16,908 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr163ASSERT_VIOLATIONVACUOUSforID045]=== [2019-04-04 17:57:16,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:16,908 INFO L82 PathProgramCache]: Analyzing trace with hash -746665553, now seen corresponding path program 1 times [2019-04-04 17:57:16,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:16,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:16,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:16,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:16,922 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:16,922 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr163ASSERT_VIOLATIONVACUOUSforID045 was UNSAFE (65/188) [2019-04-04 17:57:16,923 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:16,923 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:16,923 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:16,923 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:16,923 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:16,923 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:16,923 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:16,923 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:16,924 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr155ASSERT_VIOLATIONVACUOUSforID043======== [2019-04-04 17:57:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:16,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-04-04 17:57:16,926 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:16,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:16,926 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr155ASSERT_VIOLATIONVACUOUSforID043]=== [2019-04-04 17:57:16,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:16,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1095974489, now seen corresponding path program 1 times [2019-04-04 17:57:16,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:16,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:16,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:16,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:16,940 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:16,941 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr155ASSERT_VIOLATIONVACUOUSforID043 was UNSAFE (66/188) [2019-04-04 17:57:16,941 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:16,942 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:16,942 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:16,942 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:16,942 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:16,942 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:16,942 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:16,942 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:16,942 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr76ASSERT_VIOLATIONRTINCONSISTENTforID032_ID042======== [2019-04-04 17:57:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-04-04 17:57:16,944 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:16,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:16,945 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr76ASSERT_VIOLATIONRTINCONSISTENTforID032_ID042]=== [2019-04-04 17:57:16,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:16,945 INFO L82 PathProgramCache]: Analyzing trace with hash -244171513, now seen corresponding path program 1 times [2019-04-04 17:57:16,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:16,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:16,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:16,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:16,960 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:16,960 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr76ASSERT_VIOLATIONRTINCONSISTENTforID032_ID042 was UNSAFE (67/188) [2019-04-04 17:57:16,960 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:16,961 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:16,961 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:16,961 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:16,961 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:16,961 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:16,961 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:16,961 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:16,961 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr149ASSERT_VIOLATIONRTINCONSISTENTforID033_ID027======== [2019-04-04 17:57:16,963 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:16,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-04-04 17:57:16,964 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:16,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:16,964 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr149ASSERT_VIOLATIONRTINCONSISTENTforID033_ID027]=== [2019-04-04 17:57:16,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:16,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1522257825, now seen corresponding path program 1 times [2019-04-04 17:57:16,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:16,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:16,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:16,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:16,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:16,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:16,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:57:16,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:57:16,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:16,985 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:57:16,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:16,986 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:57:16,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:57:16,986 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 152 [2019-04-04 17:57:16,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:16,986 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:57:16,986 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:16,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:16,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:16,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:16,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:16,987 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 152 [2019-04-04 17:57:16,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:16,987 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:16,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:57:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:16,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:16,988 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr149ASSERT_VIOLATIONRTINCONSISTENTforID033_ID027 was SAFE (68/188) [2019-04-04 17:57:16,988 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:16,988 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:16,988 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:16,988 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:16,988 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:16,988 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:16,989 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:16,989 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:16,989 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr39ASSERT_VIOLATIONRTINCONSISTENTforID044_ID027======== [2019-04-04 17:57:16,990 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-04-04 17:57:16,991 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:16,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:16,991 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr39ASSERT_VIOLATIONRTINCONSISTENTforID044_ID027]=== [2019-04-04 17:57:16,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:16,991 INFO L82 PathProgramCache]: Analyzing trace with hash -400392909, now seen corresponding path program 1 times [2019-04-04 17:57:16,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:16,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:16,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:16,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:16,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:17,001 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:17,002 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr39ASSERT_VIOLATIONRTINCONSISTENTforID044_ID027 was UNSAFE (69/188) [2019-04-04 17:57:17,002 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:17,002 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:17,002 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:17,002 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:17,002 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:17,002 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:17,003 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:17,003 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:17,003 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr129ASSERT_VIOLATIONRTINCONSISTENTforID026_ID033======== [2019-04-04 17:57:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:17,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-04-04 17:57:17,005 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:17,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:17,005 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr129ASSERT_VIOLATIONRTINCONSISTENTforID026_ID033]=== [2019-04-04 17:57:17,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:17,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1139923853, now seen corresponding path program 1 times [2019-04-04 17:57:17,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:17,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:17,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:17,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:17,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:17,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:17,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:57:17,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:57:17,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:17,023 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:57:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:17,025 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:57:17,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:57:17,025 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 132 [2019-04-04 17:57:17,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:17,026 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:57:17,026 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:17,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:17,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:17,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:17,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:17,026 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2019-04-04 17:57:17,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:17,027 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:17,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:57:17,027 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:17,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:17,027 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr129ASSERT_VIOLATIONRTINCONSISTENTforID026_ID033 was SAFE (70/188) [2019-04-04 17:57:17,028 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:17,028 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:17,028 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:17,028 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:17,028 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:17,028 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:17,028 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:17,028 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:17,028 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr30ASSERT_VIOLATIONRTINCONSISTENTforID044_ID018======== [2019-04-04 17:57:17,030 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:17,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-04-04 17:57:17,030 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:17,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:17,031 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr30ASSERT_VIOLATIONRTINCONSISTENTforID044_ID018]=== [2019-04-04 17:57:17,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:17,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1402597657, now seen corresponding path program 1 times [2019-04-04 17:57:17,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:17,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:17,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:17,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:17,045 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:17,046 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr30ASSERT_VIOLATIONRTINCONSISTENTforID044_ID018 was UNSAFE (71/188) [2019-04-04 17:57:17,046 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:17,046 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:17,046 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:17,046 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:17,046 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:17,046 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:17,047 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:17,047 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:17,047 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr68ASSERT_VIOLATIONRTINCONSISTENTforID045_ID019======== [2019-04-04 17:57:17,048 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:17,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-04-04 17:57:17,049 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:17,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:17,049 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr68ASSERT_VIOLATIONRTINCONSISTENTforID045_ID019]=== [2019-04-04 17:57:17,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:17,050 INFO L82 PathProgramCache]: Analyzing trace with hash 395691007, now seen corresponding path program 1 times [2019-04-04 17:57:17,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:17,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:17,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:17,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:17,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:17,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:57:17,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:57:17,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:57:17,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:57:17,100 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:57:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:17,188 INFO L93 Difference]: Finished difference Result 344 states and 344 transitions. [2019-04-04 17:57:17,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:57:17,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-04-04 17:57:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:17,190 INFO L225 Difference]: With dead ends: 344 [2019-04-04 17:57:17,190 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:17,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:57:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:17,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:17,190 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2019-04-04 17:57:17,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:17,190 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:17,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:57:17,191 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:17,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:17,191 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr68ASSERT_VIOLATIONRTINCONSISTENTforID045_ID019 was SAFE (72/188) [2019-04-04 17:57:17,191 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:17,191 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:17,192 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:17,192 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:17,192 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:17,192 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:17,192 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:17,192 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:17,192 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr38ASSERT_VIOLATIONRTINCONSISTENTforID044_ID033======== [2019-04-04 17:57:17,194 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:17,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-04-04 17:57:17,194 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:17,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:17,194 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr38ASSERT_VIOLATIONRTINCONSISTENTforID044_ID033]=== [2019-04-04 17:57:17,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:17,195 INFO L82 PathProgramCache]: Analyzing trace with hash -290010591, now seen corresponding path program 1 times [2019-04-04 17:57:17,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:17,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:17,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:17,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:17,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:17,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:17,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:57:17,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:57:17,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:17,211 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:57:17,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:17,212 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:57:17,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:57:17,212 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 41 [2019-04-04 17:57:17,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:17,212 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:57:17,213 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:17,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:17,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:17,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:17,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:17,213 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-04-04 17:57:17,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:17,213 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:17,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:57:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:17,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:17,214 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr38ASSERT_VIOLATIONRTINCONSISTENTforID044_ID033 was SAFE (73/188) [2019-04-04 17:57:17,214 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:17,214 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:17,214 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:17,214 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:17,214 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:17,215 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:17,215 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:17,215 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:17,215 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr118ASSERT_VIOLATIONRTINCONSISTENTforID030_ID025======== [2019-04-04 17:57:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:17,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-04-04 17:57:17,217 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:17,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:17,217 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr118ASSERT_VIOLATIONRTINCONSISTENTforID030_ID025]=== [2019-04-04 17:57:17,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:17,218 INFO L82 PathProgramCache]: Analyzing trace with hash 840156273, now seen corresponding path program 1 times [2019-04-04 17:57:17,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:17,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:17,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:17,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:17,229 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:17,230 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr118ASSERT_VIOLATIONRTINCONSISTENTforID030_ID025 was UNSAFE (74/188) [2019-04-04 17:57:17,230 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:17,230 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:17,230 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:17,230 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:17,230 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:17,231 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:17,231 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:17,231 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:17,231 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr153ASSERT_VIOLATIONVACUOUSforID001======== [2019-04-04 17:57:17,232 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-04-04 17:57:17,233 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:17,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:17,234 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr153ASSERT_VIOLATIONVACUOUSforID001]=== [2019-04-04 17:57:17,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash -184380507, now seen corresponding path program 1 times [2019-04-04 17:57:17,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:17,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:17,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:17,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:17,247 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:17,248 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr153ASSERT_VIOLATIONVACUOUSforID001 was UNSAFE (75/188) [2019-04-04 17:57:17,248 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:17,249 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:17,249 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:17,249 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:17,249 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:17,249 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:17,249 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:17,249 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:17,249 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr42ASSERT_VIOLATIONRTINCONSISTENTforID021_ID042======== [2019-04-04 17:57:17,251 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-04-04 17:57:17,251 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:17,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:17,251 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr42ASSERT_VIOLATIONRTINCONSISTENTforID021_ID042]=== [2019-04-04 17:57:17,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:17,252 INFO L82 PathProgramCache]: Analyzing trace with hash -980154715, now seen corresponding path program 1 times [2019-04-04 17:57:17,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:17,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:17,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:17,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:17,263 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:17,263 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr42ASSERT_VIOLATIONRTINCONSISTENTforID021_ID042 was UNSAFE (76/188) [2019-04-04 17:57:17,264 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:17,264 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:17,264 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:17,264 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:17,264 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:17,264 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:17,264 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:17,264 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:17,265 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr90ASSERT_VIOLATIONRTINCONSISTENTforID031_ID033======== [2019-04-04 17:57:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:17,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-04-04 17:57:17,267 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:17,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:17,267 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr90ASSERT_VIOLATIONRTINCONSISTENTforID031_ID033]=== [2019-04-04 17:57:17,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:17,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1012210901, now seen corresponding path program 1 times [2019-04-04 17:57:17,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:17,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:17,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:17,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:17,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:17,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:17,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:57:17,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:57:17,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:17,284 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:57:17,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:17,286 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:57:17,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:57:17,286 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 93 [2019-04-04 17:57:17,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:17,286 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:57:17,286 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:17,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:17,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:17,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:17,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:17,287 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2019-04-04 17:57:17,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:17,287 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:17,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:57:17,287 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:17,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:17,288 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr90ASSERT_VIOLATIONRTINCONSISTENTforID031_ID033 was SAFE (77/188) [2019-04-04 17:57:17,288 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:17,289 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:17,289 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:17,289 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:17,289 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:17,289 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:17,289 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:17,289 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:17,289 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr180ASSERT_VIOLATIONVACUOUSforID025======== [2019-04-04 17:57:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:17,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-04-04 17:57:17,292 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:17,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:17,292 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr180ASSERT_VIOLATIONVACUOUSforID025]=== [2019-04-04 17:57:17,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:17,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1911627153, now seen corresponding path program 1 times [2019-04-04 17:57:17,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:17,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:17,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:17,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:17,305 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:17,306 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr180ASSERT_VIOLATIONVACUOUSforID025 was UNSAFE (78/188) [2019-04-04 17:57:17,306 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:17,307 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:17,307 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:17,307 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:17,307 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:17,307 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:17,307 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:17,307 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:17,307 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr182ASSERT_VIOLATIONVACUOUSforID020======== [2019-04-04 17:57:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:17,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-04-04 17:57:17,310 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:17,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:17,310 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr182ASSERT_VIOLATIONVACUOUSforID020]=== [2019-04-04 17:57:17,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:17,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1172343985, now seen corresponding path program 1 times [2019-04-04 17:57:17,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:17,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:17,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:17,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:17,322 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:17,323 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr182ASSERT_VIOLATIONVACUOUSforID020 was UNSAFE (79/188) [2019-04-04 17:57:17,324 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:17,324 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:17,324 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:17,324 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:17,324 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:17,324 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:17,324 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:17,324 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:17,324 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr135ASSERT_VIOLATIONRTINCONSISTENTforID023_ID019======== [2019-04-04 17:57:17,325 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:17,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-04-04 17:57:17,326 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:17,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:17,327 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr135ASSERT_VIOLATIONRTINCONSISTENTforID023_ID019]=== [2019-04-04 17:57:17,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:17,327 INFO L82 PathProgramCache]: Analyzing trace with hash -911942253, now seen corresponding path program 1 times [2019-04-04 17:57:17,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:17,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:17,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:17,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:17,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:17,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:57:17,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:57:17,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:57:17,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:57:17,406 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:57:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:17,568 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:57:17,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:57:17,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-04-04 17:57:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:17,571 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:57:17,571 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:57:17,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:57:17,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:57:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 328. [2019-04-04 17:57:17,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-04-04 17:57:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2019-04-04 17:57:17,576 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 138 [2019-04-04 17:57:17,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:17,576 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2019-04-04 17:57:17,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:57:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2019-04-04 17:57:17,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-04-04 17:57:17,578 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:17,578 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:17,578 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr135ASSERT_VIOLATIONRTINCONSISTENTforID023_ID019]=== [2019-04-04 17:57:17,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:17,579 INFO L82 PathProgramCache]: Analyzing trace with hash 823784962, now seen corresponding path program 1 times [2019-04-04 17:57:17,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:17,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:17,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:17,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:17,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:57:17,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:57:17,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:17,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 7 conjunts are in the unsatisfiable core [2019-04-04 17:57:17,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:57:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-04 17:57:17,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:57:17,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2] total 4 [2019-04-04 17:57:17,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-04-04 17:57:17,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-04-04 17:57:17,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-04-04 17:57:17,939 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand 6 states. [2019-04-04 17:57:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:18,009 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2019-04-04 17:57:18,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:57:18,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 327 [2019-04-04 17:57:18,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:18,011 INFO L225 Difference]: With dead ends: 327 [2019-04-04 17:57:18,011 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:18,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-04-04 17:57:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:18,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:18,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:18,012 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 327 [2019-04-04 17:57:18,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:18,013 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:18,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-04-04 17:57:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:18,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:18,013 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr135ASSERT_VIOLATIONRTINCONSISTENTforID023_ID019 was SAFE (80/188) [2019-04-04 17:57:18,014 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:18,014 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:18,014 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:18,014 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:18,014 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:18,014 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:18,014 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:18,014 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:18,014 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr85ASSERT_VIOLATIONRTINCONSISTENTforID031_ID024======== [2019-04-04 17:57:18,016 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-04-04 17:57:18,016 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:18,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:18,017 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr85ASSERT_VIOLATIONRTINCONSISTENTforID031_ID024]=== [2019-04-04 17:57:18,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:18,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1076924257, now seen corresponding path program 1 times [2019-04-04 17:57:18,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:18,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:18,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:18,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:18,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:18,028 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:18,029 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr85ASSERT_VIOLATIONRTINCONSISTENTforID031_ID024 was UNSAFE (81/188) [2019-04-04 17:57:18,029 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:18,030 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:18,030 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:18,030 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:18,030 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:18,030 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:18,030 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:18,030 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:18,030 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr178ASSERT_VIOLATIONVACUOUSforID034======== [2019-04-04 17:57:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-04-04 17:57:18,033 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:18,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:18,033 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr178ASSERT_VIOLATIONVACUOUSforID034]=== [2019-04-04 17:57:18,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:18,033 INFO L82 PathProgramCache]: Analyzing trace with hash 364490797, now seen corresponding path program 1 times [2019-04-04 17:57:18,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:18,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:18,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:18,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:18,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:18,047 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:18,047 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr178ASSERT_VIOLATIONVACUOUSforID034 was UNSAFE (82/188) [2019-04-04 17:57:18,048 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:18,048 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:18,048 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:18,048 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:18,048 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:18,048 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:18,048 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:18,048 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:18,049 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr41ASSERT_VIOLATIONRTINCONSISTENTforID021_ID031======== [2019-04-04 17:57:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-04-04 17:57:18,051 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:18,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:18,051 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr41ASSERT_VIOLATIONRTINCONSISTENTforID021_ID031]=== [2019-04-04 17:57:18,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:18,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1769497397, now seen corresponding path program 1 times [2019-04-04 17:57:18,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:18,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:18,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:18,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:18,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:18,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:18,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:57:18,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:57:18,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:57:18,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:57:18,177 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:57:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:18,370 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:57:18,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:57:18,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-04-04 17:57:18,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:18,373 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:57:18,373 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:57:18,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:57:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:57:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 234. [2019-04-04 17:57:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-04-04 17:57:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2019-04-04 17:57:18,378 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 44 [2019-04-04 17:57:18,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:18,378 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2019-04-04 17:57:18,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:57:18,378 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2019-04-04 17:57:18,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-04-04 17:57:18,379 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:18,379 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:18,380 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr41ASSERT_VIOLATIONRTINCONSISTENTforID021_ID031]=== [2019-04-04 17:57:18,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:18,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1557958628, now seen corresponding path program 1 times [2019-04-04 17:57:18,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:18,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:18,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:18,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:18,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:18,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:57:18,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:57:18,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:18,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 14 conjunts are in the unsatisfiable core [2019-04-04 17:57:18,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:57:19,043 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2019-04-04 17:57:19,651 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2019-04-04 17:57:19,806 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 23 [2019-04-04 17:57:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:19,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:57:19,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-04-04 17:57:19,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-04-04 17:57:19,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-04-04 17:57:19,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-04-04 17:57:19,832 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 10 states. [2019-04-04 17:57:20,353 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-04-04 17:57:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:20,402 INFO L93 Difference]: Finished difference Result 569 states and 569 transitions. [2019-04-04 17:57:20,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-04 17:57:20,403 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 233 [2019-04-04 17:57:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:20,404 INFO L225 Difference]: With dead ends: 569 [2019-04-04 17:57:20,405 INFO L226 Difference]: Without dead ends: 569 [2019-04-04 17:57:20,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-04-04 17:57:20,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-04-04 17:57:20,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 423. [2019-04-04 17:57:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-04-04 17:57:20,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2019-04-04 17:57:20,410 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 233 [2019-04-04 17:57:20,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:20,411 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2019-04-04 17:57:20,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-04-04 17:57:20,411 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2019-04-04 17:57:20,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-04-04 17:57:20,413 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:20,413 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-04-04 17:57:20,413 INFO L423 AbstractCegarLoop]: === Iteration 3 === [myProcedureErr41ASSERT_VIOLATIONRTINCONSISTENTforID021_ID031]=== [2019-04-04 17:57:20,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:20,414 INFO L82 PathProgramCache]: Analyzing trace with hash -238411371, now seen corresponding path program 2 times [2019-04-04 17:57:20,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:20,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:20,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:20,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:20,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:21,047 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-04-04 17:57:21,211 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-04-04 17:57:21,276 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:21,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:57:21,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:57:21,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:21,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 26 conjunts are in the unsatisfiable core [2019-04-04 17:57:21,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:57:21,518 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-04-04 17:57:22,188 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-04-04 17:57:23,443 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 37 [2019-04-04 17:57:23,663 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2019-04-04 17:57:23,850 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-04-04 17:57:23,980 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 24 [2019-04-04 17:57:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:24,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:57:24,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-04-04 17:57:24,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-04-04 17:57:24,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-04-04 17:57:24,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-04-04 17:57:24,009 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 14 states. [2019-04-04 17:57:24,201 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-04-04 17:57:24,455 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-04-04 17:57:24,637 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 45 [2019-04-04 17:57:24,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:24,671 INFO L93 Difference]: Finished difference Result 422 states and 422 transitions. [2019-04-04 17:57:24,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-04-04 17:57:24,672 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 422 [2019-04-04 17:57:24,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:24,672 INFO L225 Difference]: With dead ends: 422 [2019-04-04 17:57:24,673 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:24,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-04-04 17:57:24,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:24,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 422 [2019-04-04 17:57:24,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:24,675 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:24,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-04-04 17:57:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:24,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:24,676 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr41ASSERT_VIOLATIONRTINCONSISTENTforID021_ID031 was SAFE (83/188) [2019-04-04 17:57:24,676 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:24,676 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:24,676 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:24,677 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:24,677 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:24,677 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:24,677 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:24,677 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:24,677 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID043_ID031======== [2019-04-04 17:57:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:24,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-04-04 17:57:24,679 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:24,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:24,680 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID043_ID031]=== [2019-04-04 17:57:24,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:24,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1917205739, now seen corresponding path program 1 times [2019-04-04 17:57:24,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:24,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:24,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:24,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:24,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:24,693 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:24,694 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID043_ID031 was UNSAFE (84/188) [2019-04-04 17:57:24,694 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:24,694 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:24,694 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:24,695 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:24,695 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:24,695 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:24,695 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:24,695 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:24,695 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr71ASSERT_VIOLATIONRTINCONSISTENTforID047_ID025======== [2019-04-04 17:57:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:24,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-04-04 17:57:24,697 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:24,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:24,698 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr71ASSERT_VIOLATIONRTINCONSISTENTforID047_ID025]=== [2019-04-04 17:57:24,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1653564077, now seen corresponding path program 1 times [2019-04-04 17:57:24,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:24,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:24,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:24,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:24,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:24,712 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:24,713 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr71ASSERT_VIOLATIONRTINCONSISTENTforID047_ID025 was UNSAFE (85/188) [2019-04-04 17:57:24,713 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:24,713 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:24,713 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:24,713 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:24,713 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:24,714 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:24,714 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:24,714 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:24,714 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr184ASSERT_VIOLATIONVACUOUSforID033======== [2019-04-04 17:57:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:24,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-04-04 17:57:24,716 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:24,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:24,717 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr184ASSERT_VIOLATIONVACUOUSforID033]=== [2019-04-04 17:57:24,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:24,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1341173491, now seen corresponding path program 1 times [2019-04-04 17:57:24,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:24,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:24,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:24,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:24,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:24,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:24,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:24,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 17:57:24,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 17:57:24,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:57:24,783 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 3 states. [2019-04-04 17:57:24,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:24,826 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:57:24,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 17:57:24,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-04-04 17:57:24,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:24,827 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:57:24,827 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:57:24,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:57:24,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:57:24,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2019-04-04 17:57:24,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-04-04 17:57:24,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-04-04 17:57:24,833 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 187 [2019-04-04 17:57:24,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:24,833 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-04-04 17:57:24,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 17:57:24,833 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-04-04 17:57:24,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-04-04 17:57:24,835 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:24,835 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:24,835 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr184ASSERT_VIOLATIONVACUOUSforID033]=== [2019-04-04 17:57:24,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:24,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1698537060, now seen corresponding path program 1 times [2019-04-04 17:57:24,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:24,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:24,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:24,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:24,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:24,865 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:24,866 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr184ASSERT_VIOLATIONVACUOUSforID033 was UNSAFE (86/188) [2019-04-04 17:57:24,866 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:24,867 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:24,867 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:24,867 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:24,867 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:24,867 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:24,867 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:24,867 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:24,867 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr31ASSERT_VIOLATIONRTINCONSISTENTforID044_ID028======== [2019-04-04 17:57:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:24,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-04-04 17:57:24,869 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:24,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:24,869 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr31ASSERT_VIOLATIONRTINCONSISTENTforID044_ID028]=== [2019-04-04 17:57:24,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:24,870 INFO L82 PathProgramCache]: Analyzing trace with hash 530855211, now seen corresponding path program 1 times [2019-04-04 17:57:24,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:24,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:24,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:24,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:24,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:24,883 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:24,884 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr31ASSERT_VIOLATIONRTINCONSISTENTforID044_ID028 was UNSAFE (87/188) [2019-04-04 17:57:24,884 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:24,884 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:24,884 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:24,884 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:24,884 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:24,884 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:24,885 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:24,885 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:24,885 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr59ASSERT_VIOLATIONRTINCONSISTENTforID046_ID020======== [2019-04-04 17:57:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-04-04 17:57:24,886 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:24,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:24,887 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr59ASSERT_VIOLATIONRTINCONSISTENTforID046_ID020]=== [2019-04-04 17:57:24,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:24,887 INFO L82 PathProgramCache]: Analyzing trace with hash 418079047, now seen corresponding path program 1 times [2019-04-04 17:57:24,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:24,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:24,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:24,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:24,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:24,899 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:24,900 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr59ASSERT_VIOLATIONRTINCONSISTENTforID046_ID020 was UNSAFE (88/188) [2019-04-04 17:57:24,900 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:24,900 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:24,900 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:24,900 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:24,900 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:24,900 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:24,900 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:24,900 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:24,900 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr181ASSERT_VIOLATIONVACUOUSforID004======== [2019-04-04 17:57:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-04-04 17:57:24,902 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:24,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:24,902 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr181ASSERT_VIOLATIONVACUOUSforID004]=== [2019-04-04 17:57:24,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:24,902 INFO L82 PathProgramCache]: Analyzing trace with hash 869101505, now seen corresponding path program 1 times [2019-04-04 17:57:24,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:24,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:24,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:24,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:24,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:25,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:25,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:25,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 17:57:25,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 17:57:25,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:57:25,043 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 3 states. [2019-04-04 17:57:25,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:25,108 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:57:25,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 17:57:25,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-04-04 17:57:25,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:25,111 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:57:25,111 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:57:25,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 17:57:25,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:57:25,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 374. [2019-04-04 17:57:25,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-04-04 17:57:25,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 374 transitions. [2019-04-04 17:57:25,116 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 374 transitions. Word has length 184 [2019-04-04 17:57:25,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:25,117 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 374 transitions. [2019-04-04 17:57:25,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 17:57:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 374 transitions. [2019-04-04 17:57:25,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-04-04 17:57:25,118 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:25,118 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:25,119 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr181ASSERT_VIOLATIONVACUOUSforID004]=== [2019-04-04 17:57:25,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:25,119 INFO L82 PathProgramCache]: Analyzing trace with hash 974069232, now seen corresponding path program 1 times [2019-04-04 17:57:25,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:25,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:25,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:25,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:25,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:25,157 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:25,158 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr181ASSERT_VIOLATIONVACUOUSforID004 was UNSAFE (89/188) [2019-04-04 17:57:25,158 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:25,159 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:25,159 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:25,159 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:25,159 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:25,159 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:25,159 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:25,159 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:25,159 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID041_ID019======== [2019-04-04 17:57:25,161 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:25,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-04-04 17:57:25,161 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:25,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:25,161 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID041_ID019]=== [2019-04-04 17:57:25,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:25,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1655727617, now seen corresponding path program 1 times [2019-04-04 17:57:25,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:25,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:25,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:25,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:25,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:25,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:25,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:57:25,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:57:25,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:57:25,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:57:25,237 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:57:25,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:25,405 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:57:25,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:57:25,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-04-04 17:57:25,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:25,407 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:57:25,407 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:57:25,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:57:25,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:57:25,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 199. [2019-04-04 17:57:25,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-04-04 17:57:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-04-04 17:57:25,411 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 9 [2019-04-04 17:57:25,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:25,411 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2019-04-04 17:57:25,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:57:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2019-04-04 17:57:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-04-04 17:57:25,412 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:25,412 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:25,413 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID041_ID019]=== [2019-04-04 17:57:25,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:25,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1478814798, now seen corresponding path program 1 times [2019-04-04 17:57:25,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:25,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:25,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:25,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:25,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:25,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:57:25,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:57:25,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:25,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 7 conjunts are in the unsatisfiable core [2019-04-04 17:57:25,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:57:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-04 17:57:25,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:57:25,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2] total 4 [2019-04-04 17:57:25,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-04-04 17:57:25,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-04-04 17:57:25,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-04-04 17:57:25,708 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 6 states. [2019-04-04 17:57:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:25,761 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2019-04-04 17:57:25,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:57:25,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 198 [2019-04-04 17:57:25,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:25,763 INFO L225 Difference]: With dead ends: 198 [2019-04-04 17:57:25,763 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:25,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-04-04 17:57:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:25,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:25,764 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 198 [2019-04-04 17:57:25,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:25,764 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:25,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-04-04 17:57:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:25,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:25,764 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID041_ID019 was SAFE (90/188) [2019-04-04 17:57:25,765 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:25,765 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:25,765 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:25,765 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:25,765 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:25,765 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:25,765 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:25,765 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:25,765 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr150ASSERT_VIOLATIONRTINCONSISTENTforID033_ID019======== [2019-04-04 17:57:25,766 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-04-04 17:57:25,767 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:25,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:25,767 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr150ASSERT_VIOLATIONRTINCONSISTENTforID033_ID019]=== [2019-04-04 17:57:25,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:25,767 INFO L82 PathProgramCache]: Analyzing trace with hash -54646639, now seen corresponding path program 1 times [2019-04-04 17:57:25,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:25,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:25,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:25,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:25,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:25,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:25,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:25,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:57:25,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:57:25,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:25,786 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:57:25,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:25,788 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:57:25,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:57:25,788 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 153 [2019-04-04 17:57:25,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:25,788 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:57:25,788 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:25,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:25,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:25,789 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 153 [2019-04-04 17:57:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:25,789 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:25,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:57:25,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:25,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:25,790 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr150ASSERT_VIOLATIONRTINCONSISTENTforID033_ID019 was SAFE (91/188) [2019-04-04 17:57:25,790 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:25,791 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:25,791 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:25,791 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:25,791 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:25,791 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:25,791 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:25,791 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:25,791 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr119ASSERT_VIOLATIONRTINCONSISTENTforID030_ID020======== [2019-04-04 17:57:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:25,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-04-04 17:57:25,793 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:25,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:25,794 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr119ASSERT_VIOLATIONRTINCONSISTENTforID030_ID020]=== [2019-04-04 17:57:25,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:25,794 INFO L82 PathProgramCache]: Analyzing trace with hash 275041667, now seen corresponding path program 1 times [2019-04-04 17:57:25,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:25,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:25,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:25,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:25,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:25,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:25,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:57:25,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:57:25,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:57:25,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:57:25,885 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:57:26,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:26,068 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:57:26,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:57:26,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-04-04 17:57:26,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:26,071 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:57:26,071 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:57:26,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:57:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:57:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 312. [2019-04-04 17:57:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-04-04 17:57:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 312 transitions. [2019-04-04 17:57:26,075 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 312 transitions. Word has length 122 [2019-04-04 17:57:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:26,075 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 312 transitions. [2019-04-04 17:57:26,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:57:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 312 transitions. [2019-04-04 17:57:26,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-04-04 17:57:26,077 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:26,077 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:26,077 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr119ASSERT_VIOLATIONRTINCONSISTENTforID030_ID020]=== [2019-04-04 17:57:26,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:26,078 INFO L82 PathProgramCache]: Analyzing trace with hash 278832114, now seen corresponding path program 1 times [2019-04-04 17:57:26,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:26,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:26,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:26,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:26,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:26,115 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:26,116 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr119ASSERT_VIOLATIONRTINCONSISTENTforID030_ID020 was UNSAFE (92/188) [2019-04-04 17:57:26,117 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:26,117 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:26,117 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:26,117 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:26,117 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:26,117 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:26,117 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:26,117 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:26,117 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr33ASSERT_VIOLATIONRTINCONSISTENTforID044_ID030======== [2019-04-04 17:57:26,119 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:26,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-04-04 17:57:26,119 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:26,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:26,119 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr33ASSERT_VIOLATIONRTINCONSISTENTforID044_ID030]=== [2019-04-04 17:57:26,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:26,120 INFO L82 PathProgramCache]: Analyzing trace with hash -949224659, now seen corresponding path program 1 times [2019-04-04 17:57:26,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:26,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:26,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:26,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:26,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:26,132 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:26,133 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr33ASSERT_VIOLATIONRTINCONSISTENTforID044_ID030 was UNSAFE (93/188) [2019-04-04 17:57:26,133 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:26,133 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:26,133 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:26,133 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:26,133 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:26,134 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:26,134 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:26,134 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:26,134 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr60ASSERT_VIOLATIONRTINCONSISTENTforID046_ID022======== [2019-04-04 17:57:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:26,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-04-04 17:57:26,136 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:26,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:26,136 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr60ASSERT_VIOLATIONRTINCONSISTENTforID046_ID022]=== [2019-04-04 17:57:26,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:26,136 INFO L82 PathProgramCache]: Analyzing trace with hash 75549431, now seen corresponding path program 1 times [2019-04-04 17:57:26,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:26,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:26,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:26,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:26,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:26,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:26,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:57:26,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:57:26,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:57:26,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:57:26,270 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:57:26,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:26,466 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:57:26,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:57:26,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-04-04 17:57:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:26,468 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:57:26,469 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:57:26,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:57:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:57:26,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 253. [2019-04-04 17:57:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-04-04 17:57:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-04-04 17:57:26,472 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 63 [2019-04-04 17:57:26,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:26,473 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-04-04 17:57:26,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:57:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-04-04 17:57:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-04-04 17:57:26,474 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:26,474 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:26,474 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr60ASSERT_VIOLATIONRTINCONSISTENTforID046_ID022]=== [2019-04-04 17:57:26,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:26,475 INFO L82 PathProgramCache]: Analyzing trace with hash 387361256, now seen corresponding path program 1 times [2019-04-04 17:57:26,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:26,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:26,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:26,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:26,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:26,812 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-04-04 17:57:26,869 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:26,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:57:26,869 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:57:26,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:26,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 19 conjunts are in the unsatisfiable core [2019-04-04 17:57:27,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:57:27,369 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-04-04 17:57:27,641 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2019-04-04 17:57:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:27,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:57:27,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-04-04 17:57:27,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-04-04 17:57:27,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-04-04 17:57:27,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-04-04 17:57:27,669 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 10 states. [2019-04-04 17:57:28,009 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-04-04 17:57:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:28,054 INFO L93 Difference]: Finished difference Result 569 states and 569 transitions. [2019-04-04 17:57:28,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-04 17:57:28,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 252 [2019-04-04 17:57:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:28,057 INFO L225 Difference]: With dead ends: 569 [2019-04-04 17:57:28,057 INFO L226 Difference]: Without dead ends: 569 [2019-04-04 17:57:28,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-04-04 17:57:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-04-04 17:57:28,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 442. [2019-04-04 17:57:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-04-04 17:57:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 442 transitions. [2019-04-04 17:57:28,062 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 442 transitions. Word has length 252 [2019-04-04 17:57:28,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:28,062 INFO L480 AbstractCegarLoop]: Abstraction has 442 states and 442 transitions. [2019-04-04 17:57:28,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-04-04 17:57:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 442 transitions. [2019-04-04 17:57:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-04-04 17:57:28,064 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:28,064 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-04-04 17:57:28,064 INFO L423 AbstractCegarLoop]: === Iteration 3 === [myProcedureErr60ASSERT_VIOLATIONRTINCONSISTENTforID046_ID022]=== [2019-04-04 17:57:28,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:28,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1247457431, now seen corresponding path program 2 times [2019-04-04 17:57:28,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:28,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:28,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:28,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:28,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:57:28,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:57:28,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:28,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 26 conjunts are in the unsatisfiable core [2019-04-04 17:57:28,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:57:29,042 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-04-04 17:57:29,198 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-04-04 17:57:29,979 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2019-04-04 17:57:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-04 17:57:30,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:57:30,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-04-04 17:57:30,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-04-04 17:57:30,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-04-04 17:57:30,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-04-04 17:57:30,010 INFO L87 Difference]: Start difference. First operand 442 states and 442 transitions. Second operand 12 states. [2019-04-04 17:57:30,304 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-04-04 17:57:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:30,322 INFO L93 Difference]: Finished difference Result 441 states and 441 transitions. [2019-04-04 17:57:30,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-04 17:57:30,323 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 441 [2019-04-04 17:57:30,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:30,323 INFO L225 Difference]: With dead ends: 441 [2019-04-04 17:57:30,323 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:30,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 435 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-04-04 17:57:30,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:30,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:30,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:30,324 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 441 [2019-04-04 17:57:30,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:30,324 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:30,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-04-04 17:57:30,324 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:30,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:30,325 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr60ASSERT_VIOLATIONRTINCONSISTENTforID046_ID022 was SAFE (94/188) [2019-04-04 17:57:30,325 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:30,325 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:30,325 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:30,325 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:30,325 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:30,325 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:30,326 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:30,326 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:30,326 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr74ASSERT_VIOLATIONRTINCONSISTENTforID047_ID033======== [2019-04-04 17:57:30,327 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:30,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-04-04 17:57:30,328 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:30,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:30,328 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr74ASSERT_VIOLATIONRTINCONSISTENTforID047_ID033]=== [2019-04-04 17:57:30,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:30,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1948347077, now seen corresponding path program 1 times [2019-04-04 17:57:30,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:30,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:30,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:30,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:30,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:30,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:30,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:30,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:30,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:57:30,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:57:30,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:30,344 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:57:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:30,345 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:57:30,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:57:30,346 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 77 [2019-04-04 17:57:30,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:30,346 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:57:30,346 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:30,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:30,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:30,346 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2019-04-04 17:57:30,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:30,347 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:30,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:57:30,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:30,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:30,347 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr74ASSERT_VIOLATIONRTINCONSISTENTforID047_ID033 was SAFE (95/188) [2019-04-04 17:57:30,347 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:30,347 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:30,347 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:30,347 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:30,347 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:30,348 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:30,348 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:30,348 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:30,348 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr171ASSERT_VIOLATIONVACUOUSforID036======== [2019-04-04 17:57:30,349 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:30,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-04-04 17:57:30,349 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:30,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:30,349 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr171ASSERT_VIOLATIONVACUOUSforID036]=== [2019-04-04 17:57:30,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:30,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1533455945, now seen corresponding path program 1 times [2019-04-04 17:57:30,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:30,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:30,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:30,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:30,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:30,359 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:30,359 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr171ASSERT_VIOLATIONVACUOUSforID036 was UNSAFE (96/188) [2019-04-04 17:57:30,360 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:30,360 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:30,360 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:30,360 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:30,360 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:30,360 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:30,360 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:30,360 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:30,360 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr35ASSERT_VIOLATIONRTINCONSISTENTforID044_ID023======== [2019-04-04 17:57:30,361 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-04-04 17:57:30,361 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:30,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:30,362 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr35ASSERT_VIOLATIONRTINCONSISTENTforID044_ID023]=== [2019-04-04 17:57:30,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:30,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1671804625, now seen corresponding path program 1 times [2019-04-04 17:57:30,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:30,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:30,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:30,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:30,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:30,371 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:30,371 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr35ASSERT_VIOLATIONRTINCONSISTENTforID044_ID023 was UNSAFE (97/188) [2019-04-04 17:57:30,371 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:30,371 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:30,371 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:30,371 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:30,372 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:30,372 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:30,372 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:30,372 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:30,372 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr133ASSERT_VIOLATIONRTINCONSISTENTforID023_ID020======== [2019-04-04 17:57:30,373 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:30,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-04-04 17:57:30,374 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:30,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:30,374 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr133ASSERT_VIOLATIONRTINCONSISTENTforID023_ID020]=== [2019-04-04 17:57:30,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:30,374 INFO L82 PathProgramCache]: Analyzing trace with hash -81395823, now seen corresponding path program 1 times [2019-04-04 17:57:30,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:30,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:30,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:30,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:30,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:30,597 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-04-04 17:57:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:30,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:30,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:57:30,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:57:30,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:57:30,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:57:30,625 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:57:30,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:30,806 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:57:30,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:57:30,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-04-04 17:57:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:30,809 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:57:30,809 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:57:30,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:57:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:57:30,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 326. [2019-04-04 17:57:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-04-04 17:57:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2019-04-04 17:57:30,813 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 136 [2019-04-04 17:57:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:30,813 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2019-04-04 17:57:30,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:57:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2019-04-04 17:57:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-04-04 17:57:30,814 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:30,814 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:30,814 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr133ASSERT_VIOLATIONRTINCONSISTENTforID023_ID020]=== [2019-04-04 17:57:30,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:30,814 INFO L82 PathProgramCache]: Analyzing trace with hash 76834752, now seen corresponding path program 1 times [2019-04-04 17:57:30,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:30,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:30,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:30,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:30,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:30,845 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:30,846 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr133ASSERT_VIOLATIONRTINCONSISTENTforID023_ID020 was UNSAFE (98/188) [2019-04-04 17:57:30,847 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:30,847 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:30,847 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:30,847 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:30,847 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:30,847 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:30,847 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:30,847 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:30,848 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr117ASSERT_VIOLATIONRTINCONSISTENTforID000_ID033======== [2019-04-04 17:57:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-04-04 17:57:30,849 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:30,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:30,849 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr117ASSERT_VIOLATIONRTINCONSISTENTforID000_ID033]=== [2019-04-04 17:57:30,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:30,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1412575105, now seen corresponding path program 1 times [2019-04-04 17:57:30,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:30,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:30,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:30,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:30,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:30,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:30,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:30,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:57:30,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:57:30,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:30,872 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:57:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:30,874 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:57:30,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:57:30,874 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 120 [2019-04-04 17:57:30,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:30,874 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:57:30,874 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:30,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:30,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:30,875 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2019-04-04 17:57:30,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:30,875 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:30,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:57:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:30,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:30,876 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr117ASSERT_VIOLATIONRTINCONSISTENTforID000_ID033 was SAFE (99/188) [2019-04-04 17:57:30,876 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:30,876 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:30,877 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:30,877 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:30,877 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:30,877 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:30,877 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:30,877 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:30,877 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr111ASSERT_VIOLATIONRTINCONSISTENTforID029_ID025======== [2019-04-04 17:57:30,878 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:30,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-04-04 17:57:30,879 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:30,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:30,879 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr111ASSERT_VIOLATIONRTINCONSISTENTforID029_ID025]=== [2019-04-04 17:57:30,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:30,879 INFO L82 PathProgramCache]: Analyzing trace with hash 907117947, now seen corresponding path program 1 times [2019-04-04 17:57:30,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:30,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:30,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:30,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:30,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:30,890 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:30,891 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr111ASSERT_VIOLATIONRTINCONSISTENTforID029_ID025 was UNSAFE (100/188) [2019-04-04 17:57:30,891 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:30,891 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:30,891 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:30,891 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:30,891 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:30,891 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:30,891 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:30,891 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:30,892 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr75ASSERT_VIOLATIONRTINCONSISTENTforID047_ID019======== [2019-04-04 17:57:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:30,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-04-04 17:57:30,893 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:30,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:30,893 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr75ASSERT_VIOLATIONRTINCONSISTENTforID047_ID019]=== [2019-04-04 17:57:30,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash 269218135, now seen corresponding path program 1 times [2019-04-04 17:57:30,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:30,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:30,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:30,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:30,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:30,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:57:30,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:57:30,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:57:30,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:57:30,929 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:57:31,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:31,014 INFO L93 Difference]: Finished difference Result 344 states and 344 transitions. [2019-04-04 17:57:31,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:57:31,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-04-04 17:57:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:31,015 INFO L225 Difference]: With dead ends: 344 [2019-04-04 17:57:31,015 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:31,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:57:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:31,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:31,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-04-04 17:57:31,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:31,016 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:31,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:57:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:31,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:31,016 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr75ASSERT_VIOLATIONRTINCONSISTENTforID047_ID019 was SAFE (101/188) [2019-04-04 17:57:31,017 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:31,017 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:31,017 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:31,017 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:31,017 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:31,017 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:31,017 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:31,017 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:31,017 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID040_ID031======== [2019-04-04 17:57:31,018 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-04-04 17:57:31,018 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:31,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:31,019 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID040_ID031]=== [2019-04-04 17:57:31,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:31,019 INFO L82 PathProgramCache]: Analyzing trace with hash 56852811, now seen corresponding path program 1 times [2019-04-04 17:57:31,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:31,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:31,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:31,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:31,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:31,030 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:31,030 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID040_ID031 was UNSAFE (102/188) [2019-04-04 17:57:31,030 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:31,031 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:31,031 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:31,031 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:31,031 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:31,031 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:31,031 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:31,031 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:31,031 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr169ASSERT_VIOLATIONVACUOUSforID028======== [2019-04-04 17:57:31,033 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:31,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-04-04 17:57:31,033 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:31,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:31,034 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr169ASSERT_VIOLATIONVACUOUSforID028]=== [2019-04-04 17:57:31,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:31,034 INFO L82 PathProgramCache]: Analyzing trace with hash 163767221, now seen corresponding path program 1 times [2019-04-04 17:57:31,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:31,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:31,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:31,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:31,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:31,045 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:31,046 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr169ASSERT_VIOLATIONVACUOUSforID028 was UNSAFE (103/188) [2019-04-04 17:57:31,046 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:31,046 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:31,046 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:31,046 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:31,046 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:31,046 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:31,046 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:31,046 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:31,046 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr127ASSERT_VIOLATIONRTINCONSISTENTforID024_ID019======== [2019-04-04 17:57:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:31,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-04-04 17:57:31,048 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:31,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:31,048 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr127ASSERT_VIOLATIONRTINCONSISTENTforID024_ID019]=== [2019-04-04 17:57:31,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:31,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1312778869, now seen corresponding path program 1 times [2019-04-04 17:57:31,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:31,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:31,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:31,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:31,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:31,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:31,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:57:31,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:57:31,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:57:31,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:57:31,187 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:57:31,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:31,393 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:57:31,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:57:31,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-04-04 17:57:31,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:31,395 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:57:31,395 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:57:31,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:57:31,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:57:31,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 320. [2019-04-04 17:57:31,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-04-04 17:57:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 320 transitions. [2019-04-04 17:57:31,399 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 320 transitions. Word has length 130 [2019-04-04 17:57:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:31,400 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 320 transitions. [2019-04-04 17:57:31,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:57:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 320 transitions. [2019-04-04 17:57:31,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-04-04 17:57:31,401 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:31,401 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:31,401 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr127ASSERT_VIOLATIONRTINCONSISTENTforID024_ID019]=== [2019-04-04 17:57:31,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:31,402 INFO L82 PathProgramCache]: Analyzing trace with hash -412054278, now seen corresponding path program 1 times [2019-04-04 17:57:31,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:31,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:31,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:31,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:31,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:31,720 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:31,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:57:31,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:57:31,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:31,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 18 conjunts are in the unsatisfiable core [2019-04-04 17:57:31,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:57:32,518 WARN L188 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 42 [2019-04-04 17:57:32,666 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 23 [2019-04-04 17:57:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:32,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:57:32,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-04-04 17:57:32,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-04-04 17:57:32,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-04-04 17:57:32,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-04-04 17:57:32,703 INFO L87 Difference]: Start difference. First operand 320 states and 320 transitions. Second operand 10 states. [2019-04-04 17:57:33,130 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-04-04 17:57:33,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:33,177 INFO L93 Difference]: Finished difference Result 569 states and 569 transitions. [2019-04-04 17:57:33,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-04 17:57:33,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 319 [2019-04-04 17:57:33,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:33,180 INFO L225 Difference]: With dead ends: 569 [2019-04-04 17:57:33,180 INFO L226 Difference]: Without dead ends: 569 [2019-04-04 17:57:33,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-04-04 17:57:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-04-04 17:57:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 509. [2019-04-04 17:57:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-04-04 17:57:33,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 509 transitions. [2019-04-04 17:57:33,186 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 509 transitions. Word has length 319 [2019-04-04 17:57:33,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:33,186 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 509 transitions. [2019-04-04 17:57:33,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-04-04 17:57:33,186 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 509 transitions. [2019-04-04 17:57:33,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-04-04 17:57:33,189 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:33,189 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-04-04 17:57:33,189 INFO L423 AbstractCegarLoop]: === Iteration 3 === [myProcedureErr127ASSERT_VIOLATIONRTINCONSISTENTforID024_ID019]=== [2019-04-04 17:57:33,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:33,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1623608299, now seen corresponding path program 2 times [2019-04-04 17:57:33,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:33,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:33,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:33,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:33,254 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:33,255 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr127ASSERT_VIOLATIONRTINCONSISTENTforID024_ID019 was UNSAFE (104/188) [2019-04-04 17:57:33,255 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:33,256 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:33,256 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:33,256 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:33,256 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:33,256 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:33,256 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:33,256 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:33,256 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr131ASSERT_VIOLATIONRTINCONSISTENTforID034_ID033======== [2019-04-04 17:57:33,257 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:33,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-04-04 17:57:33,258 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:33,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:33,258 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr131ASSERT_VIOLATIONRTINCONSISTENTforID034_ID033]=== [2019-04-04 17:57:33,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:33,259 INFO L82 PathProgramCache]: Analyzing trace with hash 250194319, now seen corresponding path program 1 times [2019-04-04 17:57:33,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:33,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:33,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:33,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:33,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:33,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:33,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:57:33,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:57:33,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:33,276 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:57:33,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:33,277 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:57:33,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:57:33,278 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 134 [2019-04-04 17:57:33,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:33,278 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:57:33,278 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:33,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:33,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:33,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:33,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:33,278 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2019-04-04 17:57:33,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:33,279 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:33,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:57:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:33,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:33,279 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr131ASSERT_VIOLATIONRTINCONSISTENTforID034_ID033 was SAFE (105/188) [2019-04-04 17:57:33,279 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:33,279 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:33,279 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:33,279 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:33,280 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:33,280 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:33,280 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:33,280 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:33,280 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr140ASSERT_VIOLATIONRTINCONSISTENTforID025_ID019======== [2019-04-04 17:57:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-04-04 17:57:33,281 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:33,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:33,281 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr140ASSERT_VIOLATIONRTINCONSISTENTforID025_ID019]=== [2019-04-04 17:57:33,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:33,282 INFO L82 PathProgramCache]: Analyzing trace with hash -261880505, now seen corresponding path program 1 times [2019-04-04 17:57:33,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:33,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:33,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:33,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:33,292 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:33,293 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr140ASSERT_VIOLATIONRTINCONSISTENTforID025_ID019 was UNSAFE (106/188) [2019-04-04 17:57:33,293 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:33,294 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:33,294 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:33,294 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:33,294 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:33,294 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:33,294 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:33,294 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:33,294 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr22ASSERT_VIOLATIONRTINCONSISTENTforID040_ID033======== [2019-04-04 17:57:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:33,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-04-04 17:57:33,296 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:33,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:33,296 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr22ASSERT_VIOLATIONRTINCONSISTENTforID040_ID033]=== [2019-04-04 17:57:33,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:33,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1998284783, now seen corresponding path program 1 times [2019-04-04 17:57:33,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:33,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:33,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:33,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:33,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:33,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:33,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:57:33,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:57:33,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:33,317 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:57:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:33,319 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:57:33,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:57:33,319 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2019-04-04 17:57:33,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:33,319 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:57:33,319 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:33,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:33,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:33,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:33,320 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-04-04 17:57:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:33,320 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:33,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:57:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:33,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:33,321 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr22ASSERT_VIOLATIONRTINCONSISTENTforID040_ID033 was SAFE (107/188) [2019-04-04 17:57:33,321 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:33,321 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:33,322 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:33,322 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:33,322 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:33,322 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:33,322 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:33,322 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:33,322 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr100ASSERT_VIOLATIONRTINCONSISTENTforID042_ID033======== [2019-04-04 17:57:33,323 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:33,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-04-04 17:57:33,324 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:33,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:33,324 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr100ASSERT_VIOLATIONRTINCONSISTENTforID042_ID033]=== [2019-04-04 17:57:33,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:33,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1397446625, now seen corresponding path program 1 times [2019-04-04 17:57:33,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:33,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:33,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:33,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:33,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:33,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:33,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:57:33,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:57:33,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:33,349 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:57:33,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:33,350 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:57:33,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:57:33,350 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 103 [2019-04-04 17:57:33,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:33,350 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:57:33,351 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:33,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:33,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:33,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:33,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:33,351 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2019-04-04 17:57:33,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:33,352 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:33,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:57:33,352 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:33,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:33,352 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr100ASSERT_VIOLATIONRTINCONSISTENTforID042_ID033 was SAFE (108/188) [2019-04-04 17:57:33,353 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:33,353 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:33,353 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:33,353 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:33,353 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:33,353 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:33,353 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:33,353 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:33,353 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr55ASSERT_VIOLATIONRTINCONSISTENTforID046_ID031======== [2019-04-04 17:57:33,355 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:33,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-04-04 17:57:33,355 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:33,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:33,355 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr55ASSERT_VIOLATIONRTINCONSISTENTforID046_ID031]=== [2019-04-04 17:57:33,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:33,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1824034115, now seen corresponding path program 1 times [2019-04-04 17:57:33,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:33,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:33,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:33,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:33,369 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:33,370 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr55ASSERT_VIOLATIONRTINCONSISTENTforID046_ID031 was UNSAFE (109/188) [2019-04-04 17:57:33,370 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:33,370 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:33,370 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:33,370 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:33,370 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:33,370 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:33,371 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:33,371 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:33,371 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr115ASSERT_VIOLATIONRTINCONSISTENTforID036_ID034======== [2019-04-04 17:57:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:33,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-04-04 17:57:33,373 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:33,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:33,373 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr115ASSERT_VIOLATIONRTINCONSISTENTforID036_ID034]=== [2019-04-04 17:57:33,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:33,373 INFO L82 PathProgramCache]: Analyzing trace with hash 542251391, now seen corresponding path program 1 times [2019-04-04 17:57:33,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:33,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:33,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:33,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:33,387 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:33,387 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr115ASSERT_VIOLATIONRTINCONSISTENTforID036_ID034 was UNSAFE (110/188) [2019-04-04 17:57:33,387 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:33,387 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:33,387 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:33,388 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:33,388 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:33,388 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:33,388 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:33,388 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:33,388 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID040_ID042======== [2019-04-04 17:57:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-04-04 17:57:33,389 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:33,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:33,389 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID040_ID042]=== [2019-04-04 17:57:33,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:33,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1762437917, now seen corresponding path program 1 times [2019-04-04 17:57:33,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:33,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:33,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:33,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:33,399 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:33,399 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID040_ID042 was UNSAFE (111/188) [2019-04-04 17:57:33,400 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:33,400 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:33,400 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:33,400 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:33,400 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:33,400 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:33,400 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:33,401 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:33,401 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr141ASSERT_VIOLATIONRTINCONSISTENTforID004_ID033======== [2019-04-04 17:57:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:33,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-04-04 17:57:33,403 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:33,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:33,403 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr141ASSERT_VIOLATIONRTINCONSISTENTforID004_ID033]=== [2019-04-04 17:57:33,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:33,403 INFO L82 PathProgramCache]: Analyzing trace with hash 471639961, now seen corresponding path program 1 times [2019-04-04 17:57:33,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:33,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:33,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:33,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:33,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:33,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:33,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:57:33,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:57:33,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:33,429 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:57:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:33,431 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:57:33,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:57:33,431 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 144 [2019-04-04 17:57:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:33,432 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:57:33,432 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:33,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:33,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:33,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:33,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 144 [2019-04-04 17:57:33,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:33,433 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:33,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:57:33,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:33,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:33,433 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr141ASSERT_VIOLATIONRTINCONSISTENTforID004_ID033 was SAFE (112/188) [2019-04-04 17:57:33,434 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:33,434 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:33,434 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:33,434 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:33,434 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:33,435 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:33,435 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:33,435 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:33,435 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr73ASSERT_VIOLATIONRTINCONSISTENTforID047_ID022======== [2019-04-04 17:57:33,436 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:33,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-04-04 17:57:33,436 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:33,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:33,437 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr73ASSERT_VIOLATIONRTINCONSISTENTforID047_ID022]=== [2019-04-04 17:57:33,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:33,437 INFO L82 PathProgramCache]: Analyzing trace with hash 62849877, now seen corresponding path program 1 times [2019-04-04 17:57:33,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:33,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:33,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:33,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:33,703 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-04-04 17:57:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:33,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:33,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:57:33,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:57:33,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:57:33,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:57:33,728 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:57:33,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:33,877 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:57:33,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:57:33,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-04-04 17:57:33,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:33,879 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:57:33,879 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:57:33,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:57:33,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:57:33,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 266. [2019-04-04 17:57:33,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-04-04 17:57:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2019-04-04 17:57:33,883 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 76 [2019-04-04 17:57:33,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:33,884 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2019-04-04 17:57:33,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:57:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2019-04-04 17:57:33,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-04-04 17:57:33,884 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:33,885 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:33,885 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr73ASSERT_VIOLATIONRTINCONSISTENTforID047_ID022]=== [2019-04-04 17:57:33,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:33,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2115193852, now seen corresponding path program 1 times [2019-04-04 17:57:33,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:33,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:33,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:33,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-04 17:57:34,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:57:34,016 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:57:34,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:34,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 7 conjunts are in the unsatisfiable core [2019-04-04 17:57:34,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:57:34,205 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-04 17:57:34,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-04 17:57:34,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2019-04-04 17:57:34,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-04-04 17:57:34,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-04-04 17:57:34,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:57:34,225 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 5 states. [2019-04-04 17:57:34,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:34,285 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2019-04-04 17:57:34,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:57:34,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 265 [2019-04-04 17:57:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:34,287 INFO L225 Difference]: With dead ends: 265 [2019-04-04 17:57:34,287 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:34,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-04-04 17:57:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:34,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:34,288 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 265 [2019-04-04 17:57:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:34,288 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:34,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-04-04 17:57:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:34,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:34,289 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr73ASSERT_VIOLATIONRTINCONSISTENTforID047_ID022 was SAFE (113/188) [2019-04-04 17:57:34,289 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:34,290 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:34,290 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:34,290 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:34,290 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:34,290 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:34,290 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:34,290 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:34,290 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr139ASSERT_VIOLATIONRTINCONSISTENTforID025_ID027======== [2019-04-04 17:57:34,291 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:34,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-04-04 17:57:34,292 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:34,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:34,292 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr139ASSERT_VIOLATIONRTINCONSISTENTforID025_ID027]=== [2019-04-04 17:57:34,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:34,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1948110441, now seen corresponding path program 1 times [2019-04-04 17:57:34,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:34,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:34,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:34,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:34,305 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:34,306 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr139ASSERT_VIOLATIONRTINCONSISTENTforID025_ID027 was UNSAFE (114/188) [2019-04-04 17:57:34,306 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:34,306 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:34,306 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:34,306 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:34,306 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:34,306 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:34,306 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:34,306 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:34,306 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr47ASSERT_VIOLATIONRTINCONSISTENTforID037_ID033======== [2019-04-04 17:57:34,307 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:34,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-04-04 17:57:34,308 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:34,308 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:34,308 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr47ASSERT_VIOLATIONRTINCONSISTENTforID037_ID033]=== [2019-04-04 17:57:34,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:34,308 INFO L82 PathProgramCache]: Analyzing trace with hash 480855355, now seen corresponding path program 1 times [2019-04-04 17:57:34,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:34,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:34,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:34,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:34,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:34,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:34,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:57:34,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:57:34,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:34,323 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:57:34,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:34,324 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:57:34,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:57:34,324 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 50 [2019-04-04 17:57:34,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:34,324 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:57:34,324 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:34,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:34,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:34,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:34,325 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2019-04-04 17:57:34,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:34,325 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:34,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:57:34,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:34,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:34,325 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr47ASSERT_VIOLATIONRTINCONSISTENTforID037_ID033 was SAFE (115/188) [2019-04-04 17:57:34,326 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:34,326 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:34,326 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:34,326 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:34,326 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:34,326 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:34,326 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:34,326 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:34,326 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr72ASSERT_VIOLATIONRTINCONSISTENTforID047_ID020======== [2019-04-04 17:57:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:34,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-04-04 17:57:34,327 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:34,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:34,328 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr72ASSERT_VIOLATIONRTINCONSISTENTforID047_ID020]=== [2019-04-04 17:57:34,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:34,328 INFO L82 PathProgramCache]: Analyzing trace with hash 279122051, now seen corresponding path program 1 times [2019-04-04 17:57:34,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:34,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:34,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:34,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:34,337 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:34,337 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr72ASSERT_VIOLATIONRTINCONSISTENTforID047_ID020 was UNSAFE (116/188) [2019-04-04 17:57:34,337 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:34,338 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:34,338 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:34,338 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:34,338 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:34,338 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:34,338 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:34,338 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:34,338 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr130ASSERT_VIOLATIONRTINCONSISTENTforID002_ID033======== [2019-04-04 17:57:34,339 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-04-04 17:57:34,339 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:34,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:34,340 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr130ASSERT_VIOLATIONRTINCONSISTENTforID002_ID033]=== [2019-04-04 17:57:34,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:34,340 INFO L82 PathProgramCache]: Analyzing trace with hash 977902077, now seen corresponding path program 1 times [2019-04-04 17:57:34,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:34,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:34,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:34,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:34,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:34,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:34,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:57:34,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:57:34,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:34,357 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:57:34,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:34,357 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:57:34,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:57:34,358 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 133 [2019-04-04 17:57:34,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:34,358 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:57:34,358 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:34,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:34,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:34,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:34,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:34,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:34,359 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2019-04-04 17:57:34,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:34,359 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:34,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:57:34,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:34,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:34,359 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr130ASSERT_VIOLATIONRTINCONSISTENTforID002_ID033 was SAFE (117/188) [2019-04-04 17:57:34,360 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:34,360 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:34,360 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:34,360 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:34,360 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:34,360 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:34,360 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:34,360 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:34,360 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr99ASSERT_VIOLATIONRTINCONSISTENTforID042_ID022======== [2019-04-04 17:57:34,362 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:34,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-04-04 17:57:34,363 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:34,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:34,363 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr99ASSERT_VIOLATIONRTINCONSISTENTforID042_ID022]=== [2019-04-04 17:57:34,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:34,363 INFO L82 PathProgramCache]: Analyzing trace with hash 786205039, now seen corresponding path program 1 times [2019-04-04 17:57:34,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:34,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:34,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:34,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:34,377 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:34,378 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr99ASSERT_VIOLATIONRTINCONSISTENTforID042_ID022 was UNSAFE (118/188) [2019-04-04 17:57:34,378 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:34,378 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:34,378 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:34,378 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:34,378 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:34,379 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:34,379 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:34,379 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:34,379 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr170ASSERT_VIOLATIONVACUOUSforID029======== [2019-04-04 17:57:34,380 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-04-04 17:57:34,381 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:34,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:34,382 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr170ASSERT_VIOLATIONVACUOUSforID029]=== [2019-04-04 17:57:34,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:34,382 INFO L82 PathProgramCache]: Analyzing trace with hash 781817637, now seen corresponding path program 1 times [2019-04-04 17:57:34,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:34,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:34,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:34,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:34,396 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:34,396 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr170ASSERT_VIOLATIONVACUOUSforID029 was UNSAFE (119/188) [2019-04-04 17:57:34,397 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:34,397 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:34,397 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:34,397 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:34,397 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:34,397 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:34,397 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:34,397 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:34,397 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr28ASSERT_VIOLATIONRTINCONSISTENTforID044_ID032======== [2019-04-04 17:57:34,399 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:34,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-04-04 17:57:34,399 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:34,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:34,399 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr28ASSERT_VIOLATIONRTINCONSISTENTforID044_ID032]=== [2019-04-04 17:57:34,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:34,400 INFO L82 PathProgramCache]: Analyzing trace with hash -235411753, now seen corresponding path program 1 times [2019-04-04 17:57:34,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:34,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:34,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:34,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:34,412 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:34,412 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr28ASSERT_VIOLATIONRTINCONSISTENTforID044_ID032 was UNSAFE (120/188) [2019-04-04 17:57:34,413 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:34,413 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:34,413 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:34,413 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:34,413 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:34,413 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:34,413 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:34,413 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:34,413 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID001_ID033======== [2019-04-04 17:57:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:34,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-04-04 17:57:34,415 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:34,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:34,415 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID001_ID033]=== [2019-04-04 17:57:34,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:34,415 INFO L82 PathProgramCache]: Analyzing trace with hash -212050669, now seen corresponding path program 1 times [2019-04-04 17:57:34,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:34,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:34,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:34,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:34,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:34,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 17:57:34,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 17:57:34,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 17:57:34,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:34,431 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 2 states. [2019-04-04 17:57:34,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:34,431 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-04-04 17:57:34,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 17:57:34,432 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-04-04 17:57:34,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:34,432 INFO L225 Difference]: With dead ends: 345 [2019-04-04 17:57:34,432 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 17:57:34,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 17:57:34,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 17:57:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 17:57:34,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 17:57:34,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 17:57:34,432 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-04-04 17:57:34,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:34,433 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 17:57:34,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 17:57:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 17:57:34,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 17:57:34,433 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID001_ID033 was SAFE (121/188) [2019-04-04 17:57:34,433 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:34,433 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:34,433 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:34,433 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:34,433 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:34,434 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:34,434 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:34,434 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:34,434 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr95ASSERT_VIOLATIONRTINCONSISTENTforID042_ID030======== [2019-04-04 17:57:34,435 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-04-04 17:57:34,435 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:34,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:34,435 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr95ASSERT_VIOLATIONRTINCONSISTENTforID042_ID030]=== [2019-04-04 17:57:34,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:34,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1736149653, now seen corresponding path program 1 times [2019-04-04 17:57:34,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:34,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:34,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:34,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 17:57:34,444 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 17:57:34,445 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr95ASSERT_VIOLATIONRTINCONSISTENTforID042_ID030 was UNSAFE (122/188) [2019-04-04 17:57:34,445 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 17:57:34,445 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 17:57:34,445 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 17:57:34,445 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 17:57:34,445 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 17:57:34,445 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 17:57:34,445 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 17:57:34,445 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 17:57:34,446 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr24ASSERT_VIOLATIONRTINCONSISTENTforID044_ID021======== [2019-04-04 17:57:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-04-04 17:57:34,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-04-04 17:57:34,447 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:34,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:34,447 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr24ASSERT_VIOLATIONRTINCONSISTENTforID044_ID021]=== [2019-04-04 17:57:34,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:34,448 INFO L82 PathProgramCache]: Analyzing trace with hash -501269933, now seen corresponding path program 1 times [2019-04-04 17:57:34,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:34,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:34,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:34,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:34,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 17:57:34,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 17:57:34,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 17:57:34,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 17:57:34,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-04 17:57:34,533 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-04-04 17:57:34,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 17:57:34,793 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2019-04-04 17:57:34,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-04 17:57:34,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-04-04 17:57:34,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 17:57:34,795 INFO L225 Difference]: With dead ends: 688 [2019-04-04 17:57:34,796 INFO L226 Difference]: Without dead ends: 380 [2019-04-04 17:57:34,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-04 17:57:34,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-04-04 17:57:34,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 217. [2019-04-04 17:57:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-04-04 17:57:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-04-04 17:57:34,799 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 27 [2019-04-04 17:57:34,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 17:57:34,799 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-04-04 17:57:34,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 17:57:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-04-04 17:57:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-04-04 17:57:34,800 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 17:57:34,800 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 17:57:34,800 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr24ASSERT_VIOLATIONRTINCONSISTENTforID044_ID021]=== [2019-04-04 17:57:34,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 17:57:34,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1202077124, now seen corresponding path program 1 times [2019-04-04 17:57:34,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 17:57:34,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 17:57:34,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:34,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 17:57:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:35,372 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-04-04 17:57:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-04 17:57:35,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-04 17:57:35,443 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-04 17:57:35,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 17:57:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 17:57:35,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 31 conjunts are in the unsatisfiable core [2019-04-04 17:57:35,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-04 17:57:41,355 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 49 [2019-04-04 17:57:41,702 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-04-04 17:57:42,452 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 282240 conjuctions. This might take some time...