./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/bist_cell.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/bist_cell.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb52621d262b2a79ebd79f9601fb8103d2f4f11e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:30:40,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:30:41,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:30:41,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:30:41,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:30:41,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:30:41,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:30:41,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:30:41,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:30:41,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:30:41,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:30:41,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:30:41,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:30:41,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:30:41,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:30:41,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:30:41,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:30:41,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:30:41,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:30:41,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:30:41,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:30:41,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:30:41,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:30:41,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:30:41,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:30:41,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:30:41,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:30:41,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:30:41,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:30:41,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:30:41,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:30:41,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:30:41,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:30:41,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:30:41,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:30:41,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:30:41,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:30:41,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:30:41,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:30:41,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:30:41,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:30:41,084 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:30:41,116 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:30:41,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:30:41,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:30:41,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:30:41,122 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:30:41,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:30:41,123 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:30:41,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:30:41,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:30:41,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:30:41,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:30:41,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:30:41,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:30:41,126 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:30:41,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:30:41,127 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:30:41,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:30:41,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:30:41,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:30:41,128 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:30:41,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:30:41,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:30:41,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:30:41,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:30:41,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:30:41,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:30:41,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:30:41,130 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:30:41,131 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:30:41,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb52621d262b2a79ebd79f9601fb8103d2f4f11e [2019-11-28 17:30:41,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:30:41,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:30:41,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:30:41,448 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:30:41,449 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:30:41,450 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/bist_cell.cil.c [2019-11-28 17:30:41,514 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d44ddb71/ca4dc78c22da444e995be867902f1b83/FLAGf8847ab50 [2019-11-28 17:30:41,966 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:30:41,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c [2019-11-28 17:30:41,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d44ddb71/ca4dc78c22da444e995be867902f1b83/FLAGf8847ab50 [2019-11-28 17:30:42,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d44ddb71/ca4dc78c22da444e995be867902f1b83 [2019-11-28 17:30:42,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:30:42,333 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:30:42,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:30:42,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:30:42,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:30:42,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:30:42" (1/1) ... [2019-11-28 17:30:42,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10712095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:42, skipping insertion in model container [2019-11-28 17:30:42,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:30:42" (1/1) ... [2019-11-28 17:30:42,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:30:42,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:30:42,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:30:42,647 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:30:42,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:30:42,773 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:30:42,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:42 WrapperNode [2019-11-28 17:30:42,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:30:42,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:30:42,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:30:42,774 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:30:42,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:42" (1/1) ... [2019-11-28 17:30:42,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:42" (1/1) ... [2019-11-28 17:30:42,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:30:42,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:30:42,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:30:42,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:30:42,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:42" (1/1) ... [2019-11-28 17:30:42,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:42" (1/1) ... [2019-11-28 17:30:42,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:42" (1/1) ... [2019-11-28 17:30:42,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:42" (1/1) ... [2019-11-28 17:30:42,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:42" (1/1) ... [2019-11-28 17:30:42,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:42" (1/1) ... [2019-11-28 17:30:42,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:42" (1/1) ... [2019-11-28 17:30:42,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:30:42,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:30:42,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:30:42,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:30:42,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:30:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:30:42,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:30:43,486 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:30:43,487 INFO L287 CfgBuilder]: Removed 64 assume(true) statements. [2019-11-28 17:30:43,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:30:43 BoogieIcfgContainer [2019-11-28 17:30:43,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:30:43,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:30:43,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:30:43,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:30:43,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:30:42" (1/3) ... [2019-11-28 17:30:43,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8bf1ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:30:43, skipping insertion in model container [2019-11-28 17:30:43,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:42" (2/3) ... [2019-11-28 17:30:43,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8bf1ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:30:43, skipping insertion in model container [2019-11-28 17:30:43,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:30:43" (3/3) ... [2019-11-28 17:30:43,497 INFO L109 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2019-11-28 17:30:43,507 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:30:43,514 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:30:43,526 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:30:43,552 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:30:43,552 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:30:43,552 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:30:43,553 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:30:43,553 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:30:43,553 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:30:43,554 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:30:43,554 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:30:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-28 17:30:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 17:30:43,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:43,580 INFO L410 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-11-28 17:30:43,581 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:43,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:43,587 INFO L82 PathProgramCache]: Analyzing trace with hash -2133595601, now seen corresponding path program 1 times [2019-11-28 17:30:43,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:43,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611532769] [2019-11-28 17:30:43,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:43,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611532769] [2019-11-28 17:30:43,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:43,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:43,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864853858] [2019-11-28 17:30:43,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:43,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:43,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:43,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:43,781 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 3 states. [2019-11-28 17:30:43,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:43,850 INFO L93 Difference]: Finished difference Result 210 states and 352 transitions. [2019-11-28 17:30:43,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:43,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 17:30:43,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:43,874 INFO L225 Difference]: With dead ends: 210 [2019-11-28 17:30:43,874 INFO L226 Difference]: Without dead ends: 104 [2019-11-28 17:30:43,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:43,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-28 17:30:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-28 17:30:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 17:30:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 170 transitions. [2019-11-28 17:30:43,922 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 170 transitions. Word has length 27 [2019-11-28 17:30:43,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:43,923 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 170 transitions. [2019-11-28 17:30:43,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:43,923 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2019-11-28 17:30:43,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-28 17:30:43,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:43,926 INFO L410 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-11-28 17:30:43,926 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:43,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:43,927 INFO L82 PathProgramCache]: Analyzing trace with hash 431895830, now seen corresponding path program 1 times [2019-11-28 17:30:43,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:43,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123011019] [2019-11-28 17:30:43,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:44,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123011019] [2019-11-28 17:30:44,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:44,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:44,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981159071] [2019-11-28 17:30:44,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:44,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:44,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:44,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:44,004 INFO L87 Difference]: Start difference. First operand 104 states and 170 transitions. Second operand 3 states. [2019-11-28 17:30:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:44,039 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2019-11-28 17:30:44,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:44,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-28 17:30:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:44,041 INFO L225 Difference]: With dead ends: 199 [2019-11-28 17:30:44,042 INFO L226 Difference]: Without dead ends: 104 [2019-11-28 17:30:44,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:44,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-28 17:30:44,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-28 17:30:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 17:30:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2019-11-28 17:30:44,056 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 66 [2019-11-28 17:30:44,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:44,056 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2019-11-28 17:30:44,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:44,056 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2019-11-28 17:30:44,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-28 17:30:44,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:44,059 INFO L410 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] [2019-11-28 17:30:44,059 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:44,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:44,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1220222108, now seen corresponding path program 1 times [2019-11-28 17:30:44,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:44,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528878766] [2019-11-28 17:30:44,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:44,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528878766] [2019-11-28 17:30:44,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:44,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:44,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732130656] [2019-11-28 17:30:44,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:44,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:44,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:44,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:44,141 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2019-11-28 17:30:44,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:44,177 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2019-11-28 17:30:44,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:44,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-28 17:30:44,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:44,182 INFO L225 Difference]: With dead ends: 196 [2019-11-28 17:30:44,182 INFO L226 Difference]: Without dead ends: 104 [2019-11-28 17:30:44,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:44,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-28 17:30:44,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-28 17:30:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 17:30:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 168 transitions. [2019-11-28 17:30:44,194 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 168 transitions. Word has length 68 [2019-11-28 17:30:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:44,194 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 168 transitions. [2019-11-28 17:30:44,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2019-11-28 17:30:44,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-28 17:30:44,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:44,197 INFO L410 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] [2019-11-28 17:30:44,198 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:44,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:44,198 INFO L82 PathProgramCache]: Analyzing trace with hash -2086729770, now seen corresponding path program 1 times [2019-11-28 17:30:44,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:44,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745960723] [2019-11-28 17:30:44,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:44,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745960723] [2019-11-28 17:30:44,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:44,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:44,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244846672] [2019-11-28 17:30:44,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:44,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:44,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:44,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:44,263 INFO L87 Difference]: Start difference. First operand 104 states and 168 transitions. Second operand 3 states. [2019-11-28 17:30:44,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:44,299 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2019-11-28 17:30:44,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:44,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-28 17:30:44,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:44,303 INFO L225 Difference]: With dead ends: 193 [2019-11-28 17:30:44,303 INFO L226 Difference]: Without dead ends: 104 [2019-11-28 17:30:44,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:44,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-28 17:30:44,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-28 17:30:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 17:30:44,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2019-11-28 17:30:44,321 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 70 [2019-11-28 17:30:44,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:44,321 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2019-11-28 17:30:44,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:44,321 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2019-11-28 17:30:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-28 17:30:44,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:44,328 INFO L410 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] [2019-11-28 17:30:44,328 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:44,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:44,329 INFO L82 PathProgramCache]: Analyzing trace with hash 541706460, now seen corresponding path program 1 times [2019-11-28 17:30:44,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:44,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994583360] [2019-11-28 17:30:44,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:44,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994583360] [2019-11-28 17:30:44,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:44,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:44,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689049928] [2019-11-28 17:30:44,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:44,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:44,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:44,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:44,438 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand 3 states. [2019-11-28 17:30:44,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:44,482 INFO L93 Difference]: Finished difference Result 271 states and 442 transitions. [2019-11-28 17:30:44,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:44,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-28 17:30:44,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:44,485 INFO L225 Difference]: With dead ends: 271 [2019-11-28 17:30:44,486 INFO L226 Difference]: Without dead ends: 191 [2019-11-28 17:30:44,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-28 17:30:44,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2019-11-28 17:30:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-28 17:30:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 305 transitions. [2019-11-28 17:30:44,516 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 305 transitions. Word has length 72 [2019-11-28 17:30:44,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:44,517 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 305 transitions. [2019-11-28 17:30:44,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 305 transitions. [2019-11-28 17:30:44,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-28 17:30:44,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:44,520 INFO L410 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] [2019-11-28 17:30:44,521 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:44,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:44,522 INFO L82 PathProgramCache]: Analyzing trace with hash 60533476, now seen corresponding path program 1 times [2019-11-28 17:30:44,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:44,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502894414] [2019-11-28 17:30:44,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:44,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502894414] [2019-11-28 17:30:44,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:44,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:44,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063550532] [2019-11-28 17:30:44,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:44,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:44,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:44,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:44,594 INFO L87 Difference]: Start difference. First operand 188 states and 305 transitions. Second operand 3 states. [2019-11-28 17:30:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:44,683 INFO L93 Difference]: Finished difference Result 536 states and 876 transitions. [2019-11-28 17:30:44,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:44,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-28 17:30:44,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:44,689 INFO L225 Difference]: With dead ends: 536 [2019-11-28 17:30:44,689 INFO L226 Difference]: Without dead ends: 371 [2019-11-28 17:30:44,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-28 17:30:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 368. [2019-11-28 17:30:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-11-28 17:30:44,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 590 transitions. [2019-11-28 17:30:44,721 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 590 transitions. Word has length 72 [2019-11-28 17:30:44,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:44,722 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 590 transitions. [2019-11-28 17:30:44,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:44,722 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 590 transitions. [2019-11-28 17:30:44,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-28 17:30:44,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:44,726 INFO L410 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] [2019-11-28 17:30:44,726 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:44,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:44,727 INFO L82 PathProgramCache]: Analyzing trace with hash 954019814, now seen corresponding path program 1 times [2019-11-28 17:30:44,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:44,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481889217] [2019-11-28 17:30:44,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:44,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481889217] [2019-11-28 17:30:44,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:44,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:44,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306129481] [2019-11-28 17:30:44,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:44,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:44,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:44,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:44,791 INFO L87 Difference]: Start difference. First operand 368 states and 590 transitions. Second operand 3 states. [2019-11-28 17:30:44,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:44,846 INFO L93 Difference]: Finished difference Result 697 states and 1126 transitions. [2019-11-28 17:30:44,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:44,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-28 17:30:44,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:44,850 INFO L225 Difference]: With dead ends: 697 [2019-11-28 17:30:44,850 INFO L226 Difference]: Without dead ends: 408 [2019-11-28 17:30:44,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-11-28 17:30:44,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-11-28 17:30:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-28 17:30:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 648 transitions. [2019-11-28 17:30:44,877 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 648 transitions. Word has length 72 [2019-11-28 17:30:44,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:44,878 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 648 transitions. [2019-11-28 17:30:44,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:44,878 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 648 transitions. [2019-11-28 17:30:44,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 17:30:44,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:44,881 INFO L410 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-11-28 17:30:44,882 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1501854766, now seen corresponding path program 1 times [2019-11-28 17:30:44,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:44,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340648527] [2019-11-28 17:30:44,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:44,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340648527] [2019-11-28 17:30:44,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:44,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:44,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653213109] [2019-11-28 17:30:44,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:44,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:44,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:44,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:44,981 INFO L87 Difference]: Start difference. First operand 408 states and 648 transitions. Second operand 3 states. [2019-11-28 17:30:45,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:45,045 INFO L93 Difference]: Finished difference Result 1166 states and 1860 transitions. [2019-11-28 17:30:45,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:45,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-28 17:30:45,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:45,050 INFO L225 Difference]: With dead ends: 1166 [2019-11-28 17:30:45,051 INFO L226 Difference]: Without dead ends: 805 [2019-11-28 17:30:45,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:45,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-11-28 17:30:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 802. [2019-11-28 17:30:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-11-28 17:30:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1252 transitions. [2019-11-28 17:30:45,084 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1252 transitions. Word has length 73 [2019-11-28 17:30:45,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:45,084 INFO L462 AbstractCegarLoop]: Abstraction has 802 states and 1252 transitions. [2019-11-28 17:30:45,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1252 transitions. [2019-11-28 17:30:45,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 17:30:45,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:45,087 INFO L410 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-11-28 17:30:45,088 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:45,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:45,088 INFO L82 PathProgramCache]: Analyzing trace with hash -608368428, now seen corresponding path program 1 times [2019-11-28 17:30:45,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:45,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681344011] [2019-11-28 17:30:45,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:45,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:45,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681344011] [2019-11-28 17:30:45,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:45,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:45,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058779889] [2019-11-28 17:30:45,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:45,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:45,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:45,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:45,126 INFO L87 Difference]: Start difference. First operand 802 states and 1252 transitions. Second operand 3 states. [2019-11-28 17:30:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:45,184 INFO L93 Difference]: Finished difference Result 1533 states and 2406 transitions. [2019-11-28 17:30:45,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:45,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-28 17:30:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:45,189 INFO L225 Difference]: With dead ends: 1533 [2019-11-28 17:30:45,190 INFO L226 Difference]: Without dead ends: 926 [2019-11-28 17:30:45,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-28 17:30:45,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2019-11-28 17:30:45,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-28 17:30:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1426 transitions. [2019-11-28 17:30:45,228 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1426 transitions. Word has length 73 [2019-11-28 17:30:45,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:45,228 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1426 transitions. [2019-11-28 17:30:45,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1426 transitions. [2019-11-28 17:30:45,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 17:30:45,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:45,232 INFO L410 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-11-28 17:30:45,232 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:45,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:45,232 INFO L82 PathProgramCache]: Analyzing trace with hash 778416982, now seen corresponding path program 1 times [2019-11-28 17:30:45,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:45,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977307990] [2019-11-28 17:30:45,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:45,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977307990] [2019-11-28 17:30:45,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:45,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:45,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385415004] [2019-11-28 17:30:45,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:45,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:45,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:45,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:45,270 INFO L87 Difference]: Start difference. First operand 926 states and 1426 transitions. Second operand 3 states. [2019-11-28 17:30:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:45,322 INFO L93 Difference]: Finished difference Result 1353 states and 2078 transitions. [2019-11-28 17:30:45,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:45,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-28 17:30:45,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:45,326 INFO L225 Difference]: With dead ends: 1353 [2019-11-28 17:30:45,326 INFO L226 Difference]: Without dead ends: 622 [2019-11-28 17:30:45,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:45,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-11-28 17:30:45,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2019-11-28 17:30:45,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-11-28 17:30:45,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 924 transitions. [2019-11-28 17:30:45,350 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 924 transitions. Word has length 73 [2019-11-28 17:30:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:45,350 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 924 transitions. [2019-11-28 17:30:45,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 924 transitions. [2019-11-28 17:30:45,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 17:30:45,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:45,353 INFO L410 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-11-28 17:30:45,353 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:45,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:45,353 INFO L82 PathProgramCache]: Analyzing trace with hash -936880108, now seen corresponding path program 1 times [2019-11-28 17:30:45,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:45,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156194059] [2019-11-28 17:30:45,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:45,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156194059] [2019-11-28 17:30:45,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:45,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:45,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923244436] [2019-11-28 17:30:45,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:45,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:45,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:45,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:45,386 INFO L87 Difference]: Start difference. First operand 622 states and 924 transitions. Second operand 3 states. [2019-11-28 17:30:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:45,432 INFO L93 Difference]: Finished difference Result 921 states and 1366 transitions. [2019-11-28 17:30:45,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:45,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-28 17:30:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:45,436 INFO L225 Difference]: With dead ends: 921 [2019-11-28 17:30:45,436 INFO L226 Difference]: Without dead ends: 442 [2019-11-28 17:30:45,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-11-28 17:30:45,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2019-11-28 17:30:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-11-28 17:30:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 636 transitions. [2019-11-28 17:30:45,457 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 636 transitions. Word has length 73 [2019-11-28 17:30:45,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:45,457 INFO L462 AbstractCegarLoop]: Abstraction has 442 states and 636 transitions. [2019-11-28 17:30:45,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 636 transitions. [2019-11-28 17:30:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 17:30:45,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:45,459 INFO L410 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-11-28 17:30:45,459 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:45,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:45,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1482058010, now seen corresponding path program 1 times [2019-11-28 17:30:45,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:45,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280621042] [2019-11-28 17:30:45,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:45,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280621042] [2019-11-28 17:30:45,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:45,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:45,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134326734] [2019-11-28 17:30:45,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:45,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:45,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:45,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:45,500 INFO L87 Difference]: Start difference. First operand 442 states and 636 transitions. Second operand 3 states. [2019-11-28 17:30:45,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:45,522 INFO L93 Difference]: Finished difference Result 617 states and 897 transitions. [2019-11-28 17:30:45,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:45,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-28 17:30:45,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:45,526 INFO L225 Difference]: With dead ends: 617 [2019-11-28 17:30:45,526 INFO L226 Difference]: Without dead ends: 344 [2019-11-28 17:30:45,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:45,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-11-28 17:30:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-11-28 17:30:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-28 17:30:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 492 transitions. [2019-11-28 17:30:45,568 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 492 transitions. Word has length 74 [2019-11-28 17:30:45,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:45,568 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 492 transitions. [2019-11-28 17:30:45,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:45,569 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 492 transitions. [2019-11-28 17:30:45,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 17:30:45,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:45,571 INFO L410 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-11-28 17:30:45,571 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:45,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:45,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1686276329, now seen corresponding path program 1 times [2019-11-28 17:30:45,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:45,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300262594] [2019-11-28 17:30:45,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:45,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300262594] [2019-11-28 17:30:45,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:45,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:45,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731255622] [2019-11-28 17:30:45,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:45,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:45,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:45,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:45,620 INFO L87 Difference]: Start difference. First operand 344 states and 492 transitions. Second operand 3 states. [2019-11-28 17:30:45,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:45,692 INFO L93 Difference]: Finished difference Result 922 states and 1324 transitions. [2019-11-28 17:30:45,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:45,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-28 17:30:45,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:45,698 INFO L225 Difference]: With dead ends: 922 [2019-11-28 17:30:45,698 INFO L226 Difference]: Without dead ends: 665 [2019-11-28 17:30:45,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-11-28 17:30:45,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 662. [2019-11-28 17:30:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-11-28 17:30:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 932 transitions. [2019-11-28 17:30:45,739 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 932 transitions. Word has length 74 [2019-11-28 17:30:45,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:45,740 INFO L462 AbstractCegarLoop]: Abstraction has 662 states and 932 transitions. [2019-11-28 17:30:45,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:45,740 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 932 transitions. [2019-11-28 17:30:45,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 17:30:45,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:45,742 INFO L410 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-11-28 17:30:45,742 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:45,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:45,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1715204629, now seen corresponding path program 1 times [2019-11-28 17:30:45,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:45,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683686567] [2019-11-28 17:30:45,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:45,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683686567] [2019-11-28 17:30:45,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:45,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:45,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201533558] [2019-11-28 17:30:45,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:45,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:45,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:45,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:45,777 INFO L87 Difference]: Start difference. First operand 662 states and 932 transitions. Second operand 3 states. [2019-11-28 17:30:45,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:45,843 INFO L93 Difference]: Finished difference Result 1151 states and 1632 transitions. [2019-11-28 17:30:45,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:45,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-28 17:30:45,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:45,848 INFO L225 Difference]: With dead ends: 1151 [2019-11-28 17:30:45,848 INFO L226 Difference]: Without dead ends: 782 [2019-11-28 17:30:45,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:45,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-11-28 17:30:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2019-11-28 17:30:45,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-11-28 17:30:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1082 transitions. [2019-11-28 17:30:45,892 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1082 transitions. Word has length 74 [2019-11-28 17:30:45,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:45,892 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1082 transitions. [2019-11-28 17:30:45,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:45,893 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1082 transitions. [2019-11-28 17:30:45,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 17:30:45,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:45,895 INFO L410 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-11-28 17:30:45,896 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:45,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:45,896 INFO L82 PathProgramCache]: Analyzing trace with hash -328419219, now seen corresponding path program 1 times [2019-11-28 17:30:45,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:45,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311404046] [2019-11-28 17:30:45,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:45,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311404046] [2019-11-28 17:30:45,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:45,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:45,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080616405] [2019-11-28 17:30:45,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:45,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:45,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:45,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:45,934 INFO L87 Difference]: Start difference. First operand 782 states and 1082 transitions. Second operand 3 states. [2019-11-28 17:30:46,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:46,001 INFO L93 Difference]: Finished difference Result 1061 states and 1472 transitions. [2019-11-28 17:30:46,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:46,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-28 17:30:46,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:46,006 INFO L225 Difference]: With dead ends: 1061 [2019-11-28 17:30:46,006 INFO L226 Difference]: Without dead ends: 572 [2019-11-28 17:30:46,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:46,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-11-28 17:30:46,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2019-11-28 17:30:46,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-11-28 17:30:46,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 766 transitions. [2019-11-28 17:30:46,042 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 766 transitions. Word has length 74 [2019-11-28 17:30:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:46,042 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 766 transitions. [2019-11-28 17:30:46,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 766 transitions. [2019-11-28 17:30:46,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 17:30:46,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:46,044 INFO L410 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-11-28 17:30:46,044 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:46,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:46,045 INFO L82 PathProgramCache]: Analyzing trace with hash -524997684, now seen corresponding path program 1 times [2019-11-28 17:30:46,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:46,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772212988] [2019-11-28 17:30:46,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:46,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772212988] [2019-11-28 17:30:46,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:46,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:46,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427421318] [2019-11-28 17:30:46,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:46,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:46,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:46,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:46,087 INFO L87 Difference]: Start difference. First operand 572 states and 766 transitions. Second operand 3 states. [2019-11-28 17:30:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:46,124 INFO L93 Difference]: Finished difference Result 741 states and 1005 transitions. [2019-11-28 17:30:46,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:46,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-28 17:30:46,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:46,128 INFO L225 Difference]: With dead ends: 741 [2019-11-28 17:30:46,128 INFO L226 Difference]: Without dead ends: 478 [2019-11-28 17:30:46,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:46,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-28 17:30:46,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2019-11-28 17:30:46,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-11-28 17:30:46,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 638 transitions. [2019-11-28 17:30:46,160 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 638 transitions. Word has length 75 [2019-11-28 17:30:46,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:46,161 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 638 transitions. [2019-11-28 17:30:46,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 638 transitions. [2019-11-28 17:30:46,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 17:30:46,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:46,164 INFO L410 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-11-28 17:30:46,164 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:46,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:46,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1795209225, now seen corresponding path program 1 times [2019-11-28 17:30:46,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:46,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845295055] [2019-11-28 17:30:46,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:46,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845295055] [2019-11-28 17:30:46,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:46,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:46,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819817805] [2019-11-28 17:30:46,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:46,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:46,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:46,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:46,210 INFO L87 Difference]: Start difference. First operand 478 states and 638 transitions. Second operand 3 states. [2019-11-28 17:30:46,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:46,302 INFO L93 Difference]: Finished difference Result 1220 states and 1622 transitions. [2019-11-28 17:30:46,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:46,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-28 17:30:46,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:46,309 INFO L225 Difference]: With dead ends: 1220 [2019-11-28 17:30:46,309 INFO L226 Difference]: Without dead ends: 909 [2019-11-28 17:30:46,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:46,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-28 17:30:46,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 906. [2019-11-28 17:30:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-11-28 17:30:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1184 transitions. [2019-11-28 17:30:46,356 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1184 transitions. Word has length 75 [2019-11-28 17:30:46,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:46,356 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1184 transitions. [2019-11-28 17:30:46,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1184 transitions. [2019-11-28 17:30:46,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 17:30:46,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:46,360 INFO L410 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-11-28 17:30:46,360 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:46,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:46,360 INFO L82 PathProgramCache]: Analyzing trace with hash 810814329, now seen corresponding path program 1 times [2019-11-28 17:30:46,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:46,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486829197] [2019-11-28 17:30:46,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,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-11-28 17:30:46,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486829197] [2019-11-28 17:30:46,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:46,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:46,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651398936] [2019-11-28 17:30:46,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:46,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:46,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:46,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:46,412 INFO L87 Difference]: Start difference. First operand 906 states and 1184 transitions. Second operand 3 states. [2019-11-28 17:30:46,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:46,468 INFO L93 Difference]: Finished difference Result 1075 states and 1414 transitions. [2019-11-28 17:30:46,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:46,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-28 17:30:46,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:46,473 INFO L225 Difference]: With dead ends: 1075 [2019-11-28 17:30:46,474 INFO L226 Difference]: Without dead ends: 1072 [2019-11-28 17:30:46,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2019-11-28 17:30:46,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2019-11-28 17:30:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2019-11-28 17:30:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1410 transitions. [2019-11-28 17:30:46,524 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1410 transitions. Word has length 75 [2019-11-28 17:30:46,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:46,525 INFO L462 AbstractCegarLoop]: Abstraction has 1072 states and 1410 transitions. [2019-11-28 17:30:46,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1410 transitions. [2019-11-28 17:30:46,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-28 17:30:46,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:46,528 INFO L410 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-11-28 17:30:46,528 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:46,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:46,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1383852991, now seen corresponding path program 1 times [2019-11-28 17:30:46,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:46,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266716615] [2019-11-28 17:30:46,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:46,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266716615] [2019-11-28 17:30:46,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:46,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:46,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672275182] [2019-11-28 17:30:46,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:46,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:46,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:46,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:46,567 INFO L87 Difference]: Start difference. First operand 1072 states and 1410 transitions. Second operand 3 states. [2019-11-28 17:30:46,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:46,629 INFO L93 Difference]: Finished difference Result 1999 states and 2700 transitions. [2019-11-28 17:30:46,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:46,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-28 17:30:46,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:46,635 INFO L225 Difference]: With dead ends: 1999 [2019-11-28 17:30:46,635 INFO L226 Difference]: Without dead ends: 1006 [2019-11-28 17:30:46,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:46,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-11-28 17:30:46,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 940. [2019-11-28 17:30:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-11-28 17:30:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1246 transitions. [2019-11-28 17:30:46,685 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1246 transitions. Word has length 77 [2019-11-28 17:30:46,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:46,686 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1246 transitions. [2019-11-28 17:30:46,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1246 transitions. [2019-11-28 17:30:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-28 17:30:46,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:46,689 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 17:30:46,689 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:46,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:46,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1984147797, now seen corresponding path program 1 times [2019-11-28 17:30:46,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:46,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46326410] [2019-11-28 17:30:46,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:46,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46326410] [2019-11-28 17:30:46,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:46,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:30:46,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969410418] [2019-11-28 17:30:46,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:30:46,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:46,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:30:46,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:30:46,733 INFO L87 Difference]: Start difference. First operand 940 states and 1246 transitions. Second operand 4 states. [2019-11-28 17:30:46,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:46,801 INFO L93 Difference]: Finished difference Result 1579 states and 2134 transitions. [2019-11-28 17:30:46,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:30:46,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-28 17:30:46,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:46,806 INFO L225 Difference]: With dead ends: 1579 [2019-11-28 17:30:46,806 INFO L226 Difference]: Without dead ends: 940 [2019-11-28 17:30:46,807 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-28 17:30:46,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-11-28 17:30:46,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-11-28 17:30:46,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-11-28 17:30:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1240 transitions. [2019-11-28 17:30:46,870 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1240 transitions. Word has length 91 [2019-11-28 17:30:46,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:46,870 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1240 transitions. [2019-11-28 17:30:46,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:30:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1240 transitions. [2019-11-28 17:30:46,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-28 17:30:46,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:46,873 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 17:30:46,873 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:46,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:46,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1157899978, now seen corresponding path program 1 times [2019-11-28 17:30:46,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:46,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221058285] [2019-11-28 17:30:46,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:46,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221058285] [2019-11-28 17:30:46,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:46,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:30:46,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943558355] [2019-11-28 17:30:46,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:30:46,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:46,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:30:46,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:30:46,922 INFO L87 Difference]: Start difference. First operand 940 states and 1240 transitions. Second operand 4 states. [2019-11-28 17:30:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:46,999 INFO L93 Difference]: Finished difference Result 1579 states and 2122 transitions. [2019-11-28 17:30:46,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:30:46,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-28 17:30:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:47,004 INFO L225 Difference]: With dead ends: 1579 [2019-11-28 17:30:47,004 INFO L226 Difference]: Without dead ends: 940 [2019-11-28 17:30:47,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-28 17:30:47,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-11-28 17:30:47,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-11-28 17:30:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-11-28 17:30:47,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1234 transitions. [2019-11-28 17:30:47,085 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1234 transitions. Word has length 92 [2019-11-28 17:30:47,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:47,086 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1234 transitions. [2019-11-28 17:30:47,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:30:47,086 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1234 transitions. [2019-11-28 17:30:47,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 17:30:47,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:47,088 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 17:30:47,089 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:47,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:47,089 INFO L82 PathProgramCache]: Analyzing trace with hash 433852849, now seen corresponding path program 1 times [2019-11-28 17:30:47,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:47,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268509754] [2019-11-28 17:30:47,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:47,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:47,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268509754] [2019-11-28 17:30:47,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:47,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:47,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426176031] [2019-11-28 17:30:47,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:47,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:47,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:47,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:47,123 INFO L87 Difference]: Start difference. First operand 940 states and 1234 transitions. Second operand 3 states. [2019-11-28 17:30:47,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:47,228 INFO L93 Difference]: Finished difference Result 2176 states and 2914 transitions. [2019-11-28 17:30:47,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:47,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-28 17:30:47,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:47,237 INFO L225 Difference]: With dead ends: 2176 [2019-11-28 17:30:47,238 INFO L226 Difference]: Without dead ends: 1537 [2019-11-28 17:30:47,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:47,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2019-11-28 17:30:47,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 958. [2019-11-28 17:30:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-11-28 17:30:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1252 transitions. [2019-11-28 17:30:47,314 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1252 transitions. Word has length 93 [2019-11-28 17:30:47,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:47,314 INFO L462 AbstractCegarLoop]: Abstraction has 958 states and 1252 transitions. [2019-11-28 17:30:47,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:47,315 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1252 transitions. [2019-11-28 17:30:47,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-28 17:30:47,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:47,317 INFO L410 BasicCegarLoop]: trace histogram [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-11-28 17:30:47,318 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:47,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:47,318 INFO L82 PathProgramCache]: Analyzing trace with hash 124550695, now seen corresponding path program 1 times [2019-11-28 17:30:47,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:47,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695492131] [2019-11-28 17:30:47,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:47,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695492131] [2019-11-28 17:30:47,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:47,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:30:47,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271611141] [2019-11-28 17:30:47,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:30:47,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:47,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:30:47,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:30:47,388 INFO L87 Difference]: Start difference. First operand 958 states and 1252 transitions. Second operand 4 states. [2019-11-28 17:30:47,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:47,465 INFO L93 Difference]: Finished difference Result 1591 states and 2098 transitions. [2019-11-28 17:30:47,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:30:47,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-28 17:30:47,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:47,470 INFO L225 Difference]: With dead ends: 1591 [2019-11-28 17:30:47,470 INFO L226 Difference]: Without dead ends: 934 [2019-11-28 17:30:47,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-28 17:30:47,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2019-11-28 17:30:47,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2019-11-28 17:30:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2019-11-28 17:30:47,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1198 transitions. [2019-11-28 17:30:47,534 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1198 transitions. Word has length 94 [2019-11-28 17:30:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:47,534 INFO L462 AbstractCegarLoop]: Abstraction has 934 states and 1198 transitions. [2019-11-28 17:30:47,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:30:47,535 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1198 transitions. [2019-11-28 17:30:47,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 17:30:47,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:47,537 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 17:30:47,537 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:47,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:47,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2108597088, now seen corresponding path program 1 times [2019-11-28 17:30:47,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:47,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395315151] [2019-11-28 17:30:47,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:47,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395315151] [2019-11-28 17:30:47,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:47,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:47,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701680256] [2019-11-28 17:30:47,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:47,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:47,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:47,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:47,569 INFO L87 Difference]: Start difference. First operand 934 states and 1198 transitions. Second operand 3 states. [2019-11-28 17:30:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:47,665 INFO L93 Difference]: Finished difference Result 2188 states and 2860 transitions. [2019-11-28 17:30:47,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:47,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-28 17:30:47,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:47,673 INFO L225 Difference]: With dead ends: 2188 [2019-11-28 17:30:47,673 INFO L226 Difference]: Without dead ends: 1555 [2019-11-28 17:30:47,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:47,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-11-28 17:30:47,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 958. [2019-11-28 17:30:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-11-28 17:30:47,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1222 transitions. [2019-11-28 17:30:47,755 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1222 transitions. Word has length 95 [2019-11-28 17:30:47,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:47,756 INFO L462 AbstractCegarLoop]: Abstraction has 958 states and 1222 transitions. [2019-11-28 17:30:47,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1222 transitions. [2019-11-28 17:30:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 17:30:47,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:47,760 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 17:30:47,761 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:47,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:47,761 INFO L82 PathProgramCache]: Analyzing trace with hash -169435042, now seen corresponding path program 1 times [2019-11-28 17:30:47,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:47,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78109301] [2019-11-28 17:30:47,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:47,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78109301] [2019-11-28 17:30:47,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:47,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:47,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038244632] [2019-11-28 17:30:47,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:47,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:47,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:47,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:47,816 INFO L87 Difference]: Start difference. First operand 958 states and 1222 transitions. Second operand 3 states. [2019-11-28 17:30:47,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:47,989 INFO L93 Difference]: Finished difference Result 2220 states and 2810 transitions. [2019-11-28 17:30:47,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:47,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-28 17:30:47,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:47,997 INFO L225 Difference]: With dead ends: 2220 [2019-11-28 17:30:47,997 INFO L226 Difference]: Without dead ends: 1563 [2019-11-28 17:30:47,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:48,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-11-28 17:30:48,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1560. [2019-11-28 17:30:48,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-11-28 17:30:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1914 transitions. [2019-11-28 17:30:48,170 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1914 transitions. Word has length 95 [2019-11-28 17:30:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:48,171 INFO L462 AbstractCegarLoop]: Abstraction has 1560 states and 1914 transitions. [2019-11-28 17:30:48,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1914 transitions. [2019-11-28 17:30:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 17:30:48,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:48,174 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 17:30:48,174 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:48,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:48,174 INFO L82 PathProgramCache]: Analyzing trace with hash 254211680, now seen corresponding path program 1 times [2019-11-28 17:30:48,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:48,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433483952] [2019-11-28 17:30:48,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:48,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433483952] [2019-11-28 17:30:48,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802511112] [2019-11-28 17:30:48,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:48,429 INFO L264 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 17:30:48,445 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:48,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:48,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 17:30:48,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-28 17:30:48,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593253409] [2019-11-28 17:30:48,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:30:48,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:48,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:30:48,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:30:48,550 INFO L87 Difference]: Start difference. First operand 1560 states and 1914 transitions. Second operand 4 states. [2019-11-28 17:30:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:48,803 INFO L93 Difference]: Finished difference Result 2609 states and 3234 transitions. [2019-11-28 17:30:48,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:30:48,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-28 17:30:48,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:48,813 INFO L225 Difference]: With dead ends: 2609 [2019-11-28 17:30:48,813 INFO L226 Difference]: Without dead ends: 1906 [2019-11-28 17:30:48,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:30:48,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2019-11-28 17:30:48,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1610. [2019-11-28 17:30:48,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2019-11-28 17:30:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1982 transitions. [2019-11-28 17:30:48,956 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1982 transitions. Word has length 95 [2019-11-28 17:30:48,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:48,957 INFO L462 AbstractCegarLoop]: Abstraction has 1610 states and 1982 transitions. [2019-11-28 17:30:48,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:30:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1982 transitions. [2019-11-28 17:30:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 17:30:48,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:48,960 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 17:30:49,163 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:49,163 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:49,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:49,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1147698018, now seen corresponding path program 1 times [2019-11-28 17:30:49,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:49,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023994494] [2019-11-28 17:30:49,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:49,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:49,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023994494] [2019-11-28 17:30:49,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:49,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:30:49,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651250157] [2019-11-28 17:30:49,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:30:49,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:49,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:30:49,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:30:49,234 INFO L87 Difference]: Start difference. First operand 1610 states and 1982 transitions. Second operand 3 states. [2019-11-28 17:30:49,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:49,581 INFO L93 Difference]: Finished difference Result 3706 states and 4622 transitions. [2019-11-28 17:30:49,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:30:49,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-28 17:30:49,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:49,599 INFO L225 Difference]: With dead ends: 3706 [2019-11-28 17:30:49,599 INFO L226 Difference]: Without dead ends: 2603 [2019-11-28 17:30:49,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:30:49,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2019-11-28 17:30:49,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 1628. [2019-11-28 17:30:49,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2019-11-28 17:30:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2000 transitions. [2019-11-28 17:30:49,788 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2000 transitions. Word has length 95 [2019-11-28 17:30:49,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:49,788 INFO L462 AbstractCegarLoop]: Abstraction has 1628 states and 2000 transitions. [2019-11-28 17:30:49,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:30:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2000 transitions. [2019-11-28 17:30:49,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 17:30:49,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:49,791 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 17:30:49,792 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:49,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:49,792 INFO L82 PathProgramCache]: Analyzing trace with hash 746876002, now seen corresponding path program 1 times [2019-11-28 17:30:49,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:49,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503308748] [2019-11-28 17:30:49,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:49,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:30:49,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503308748] [2019-11-28 17:30:49,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:49,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:30:49,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83985932] [2019-11-28 17:30:49,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:30:49,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:49,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:30:49,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:30:49,845 INFO L87 Difference]: Start difference. First operand 1628 states and 2000 transitions. Second operand 4 states. [2019-11-28 17:30:49,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:49,955 INFO L93 Difference]: Finished difference Result 1970 states and 2418 transitions. [2019-11-28 17:30:49,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:30:49,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-28 17:30:49,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:49,956 INFO L225 Difference]: With dead ends: 1970 [2019-11-28 17:30:49,956 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 17:30:49,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-28 17:30:49,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 17:30:49,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 17:30:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 17:30:49,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 17:30:49,960 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2019-11-28 17:30:49,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:49,960 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 17:30:49,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:30:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 17:30:49,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 17:30:49,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 17:30:50,111 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-11-28 17:30:50,270 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-11-28 17:30:50,580 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 126 [2019-11-28 17:30:51,138 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-11-28 17:30:51,788 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-11-28 17:30:52,076 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 126 [2019-11-28 17:30:52,696 WARN L192 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-28 17:30:53,403 WARN L192 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-28 17:30:53,921 WARN L192 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-28 17:30:54,254 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-28 17:30:54,425 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-28 17:30:55,159 WARN L192 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 49 [2019-11-28 17:30:55,372 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-28 17:30:55,708 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-28 17:30:56,416 WARN L192 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-28 17:30:56,617 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-28 17:30:56,954 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-28 17:30:57,159 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-28 17:30:57,690 WARN L192 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-28 17:30:58,186 WARN L192 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-28 17:30:58,517 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-28 17:30:59,227 WARN L192 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-28 17:30:59,417 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-28 17:31:00,122 WARN L192 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-28 17:31:00,457 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-28 17:31:00,878 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-11-28 17:31:01,234 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-28 17:31:01,490 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-11-28 17:31:02,270 WARN L192 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-28 17:31:02,464 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-28 17:31:03,180 WARN L192 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-28 17:31:03,678 WARN L192 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-28 17:31:04,395 WARN L192 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-28 17:31:05,104 WARN L192 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 49 [2019-11-28 17:31:05,872 WARN L192 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-11-28 17:31:05,876 INFO L246 CegarLoopResult]: For program point L69(lines 41 91) no Hoare annotation was computed. [2019-11-28 17:31:05,877 INFO L249 CegarLoopResult]: At program point L499(lines 483 501) the Hoare annotation is: true [2019-11-28 17:31:05,877 INFO L242 CegarLoopResult]: At program point L301(lines 269 306) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 17:31:05,877 INFO L246 CegarLoopResult]: For program point L202(lines 202 208) no Hoare annotation was computed. [2019-11-28 17:31:05,877 INFO L242 CegarLoopResult]: At program point L202-1(lines 201 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (<= 2 ~d1_ev~0)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (<= 2 ~b1_ev~0)) (.cse9 (= ~d1_req_up~0 1)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val_t~0)) (.cse13 (<= ~b0_req_up~0 0)) (.cse14 (= 1 ~b1_req_up~0)) (.cse15 (<= 2 ~z_ev~0)) (.cse16 (= ~d0_req_up~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~b0_ev~0 0) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~b0_ev~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2019-11-28 17:31:05,878 INFO L246 CegarLoopResult]: For program point L202-2(lines 202 208) no Hoare annotation was computed. [2019-11-28 17:31:05,878 INFO L242 CegarLoopResult]: At program point L202-3(lines 201 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 17:31:05,878 INFO L246 CegarLoopResult]: For program point L70(lines 70 74) no Hoare annotation was computed. [2019-11-28 17:31:05,878 INFO L246 CegarLoopResult]: For program point L105(lines 105 115) no Hoare annotation was computed. [2019-11-28 17:31:05,878 INFO L246 CegarLoopResult]: For program point L105-1(lines 105 115) no Hoare annotation was computed. [2019-11-28 17:31:05,879 INFO L246 CegarLoopResult]: For program point L172(lines 172 177) no Hoare annotation was computed. [2019-11-28 17:31:05,879 INFO L246 CegarLoopResult]: For program point L172-2(lines 172 177) no Hoare annotation was computed. [2019-11-28 17:31:05,879 INFO L246 CegarLoopResult]: For program point L172-3(lines 172 177) no Hoare annotation was computed. [2019-11-28 17:31:05,879 INFO L246 CegarLoopResult]: For program point L172-5(lines 172 177) no Hoare annotation was computed. [2019-11-28 17:31:05,880 INFO L242 CegarLoopResult]: At program point L404(lines 393 406) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-28 17:31:05,880 INFO L242 CegarLoopResult]: At program point L405(lines 389 407) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-28 17:31:05,880 INFO L246 CegarLoopResult]: For program point L42(lines 42 50) no Hoare annotation was computed. [2019-11-28 17:31:05,880 INFO L246 CegarLoopResult]: For program point L42-1(lines 41 91) no Hoare annotation was computed. [2019-11-28 17:31:05,880 INFO L246 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2019-11-28 17:31:05,880 INFO L246 CegarLoopResult]: For program point L439(lines 439 443) no Hoare annotation was computed. [2019-11-28 17:31:05,880 INFO L246 CegarLoopResult]: For program point L142(lines 142 147) no Hoare annotation was computed. [2019-11-28 17:31:05,881 INFO L246 CegarLoopResult]: For program point L109(lines 109 114) no Hoare annotation was computed. [2019-11-28 17:31:05,881 INFO L246 CegarLoopResult]: For program point L142-2(lines 142 147) no Hoare annotation was computed. [2019-11-28 17:31:05,881 INFO L246 CegarLoopResult]: For program point L109-1(lines 109 114) no Hoare annotation was computed. [2019-11-28 17:31:05,881 INFO L246 CegarLoopResult]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-11-28 17:31:05,881 INFO L246 CegarLoopResult]: For program point L142-3(lines 142 147) no Hoare annotation was computed. [2019-11-28 17:31:05,881 INFO L246 CegarLoopResult]: For program point L142-5(lines 142 147) no Hoare annotation was computed. [2019-11-28 17:31:05,881 INFO L242 CegarLoopResult]: At program point L209(lines 201 239) the Hoare annotation is: (let ((.cse19 (= ~b1_ev~0 0)) (.cse5 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse6 (<= 2 ~d1_ev~0)) (.cse7 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~b1_val_t~0)) (.cse9 (<= 2 ~b1_ev~0)) (.cse10 (= ~d1_req_up~0 1)) (.cse11 (= 0 ~z_val_t~0)) (.cse12 (<= ~z_val~0 0)) (.cse20 (= ~b0_ev~0 0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0)) (.cse18 (= ~d0_req_up~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2019-11-28 17:31:05,882 INFO L242 CegarLoopResult]: At program point L209-1(lines 201 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 17:31:05,882 INFO L246 CegarLoopResult]: For program point L276(line 276) no Hoare annotation was computed. [2019-11-28 17:31:05,882 INFO L246 CegarLoopResult]: For program point L344-1(lines 343 371) no Hoare annotation was computed. [2019-11-28 17:31:05,882 INFO L246 CegarLoopResult]: For program point L311-1(lines 310 338) no Hoare annotation was computed. [2019-11-28 17:31:05,882 INFO L246 CegarLoopResult]: For program point L311-2(lines 311 315) no Hoare annotation was computed. [2019-11-28 17:31:05,882 INFO L246 CegarLoopResult]: For program point L344-3(lines 343 371) no Hoare annotation was computed. [2019-11-28 17:31:05,882 INFO L242 CegarLoopResult]: At program point L245-1(lines 311 315) the Hoare annotation is: (let ((.cse18 (= ~b1_ev~0 0)) (.cse9 (= 0 ~d0_ev~0)) (.cse20 (= ~b0_ev~0 0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-28 17:31:05,883 INFO L246 CegarLoopResult]: For program point L311-4(lines 310 338) no Hoare annotation was computed. [2019-11-28 17:31:05,883 INFO L246 CegarLoopResult]: For program point L81(lines 81 85) no Hoare annotation was computed. [2019-11-28 17:31:05,883 INFO L246 CegarLoopResult]: For program point L81-2(lines 78 86) no Hoare annotation was computed. [2019-11-28 17:31:05,883 INFO L242 CegarLoopResult]: At program point L445(lines 491 497) the Hoare annotation is: (and (= ~z_val~0 0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0)) [2019-11-28 17:31:05,883 INFO L246 CegarLoopResult]: For program point L280(lines 280 284) no Hoare annotation was computed. [2019-11-28 17:31:05,883 INFO L246 CegarLoopResult]: For program point L280-1(lines 275 300) no Hoare annotation was computed. [2019-11-28 17:31:05,883 INFO L246 CegarLoopResult]: For program point L380(lines 380 384) no Hoare annotation was computed. [2019-11-28 17:31:05,884 INFO L242 CegarLoopResult]: At program point L380-2(lines 344 348) the Hoare annotation is: (let ((.cse3 (= ~b1_ev~0 1)) (.cse18 (<= 2 ~d0_ev~0)) (.cse19 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (= ~b0_ev~0 1)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (= 1 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse19 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse19 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-28 17:31:05,884 INFO L246 CegarLoopResult]: For program point L380-3(lines 380 384) no Hoare annotation was computed. [2019-11-28 17:31:05,884 INFO L242 CegarLoopResult]: At program point L380-5(lines 344 348) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 1 ~d0_ev~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 17:31:05,884 INFO L242 CegarLoopResult]: At program point L480(lines 451 482) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 2 ~d1_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (= ~d1_req_up~0 1) (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (<= ~z_val~0 0) (<= 1 ~d0_val_t~0) (= 1 ~b1_req_up~0) (<= 2 ~z_ev~0) (= ~d0_req_up~0 1)) [2019-11-28 17:31:05,885 INFO L242 CegarLoopResult]: At program point L216(lines 201 239) the Hoare annotation is: (let ((.cse20 (<= 2 ~b0_ev~0)) (.cse9 (= 0 ~d0_ev~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse19 (= ~b1_ev~0 0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse21 (<= 2 ~d0_ev~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~d1_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse8 (= ~d1_req_up~0 1)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (= ~b0_ev~0 0)) (.cse13 (<= 1 ~d0_val~0)) (.cse14 (<= 1 ~d0_val_t~0)) (.cse15 (<= ~b0_req_up~0 0)) (.cse16 (<= ~b1_req_up~0 0)) (.cse17 (<= 2 ~z_ev~0)) (.cse18 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse21 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse21 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2019-11-28 17:31:05,885 INFO L242 CegarLoopResult]: At program point L216-1(lines 201 239) the Hoare annotation is: (let ((.cse3 (<= 2 ~d0_ev~0)) (.cse18 (not (= ~z_req_up~0 1))) (.cse0 (<= 2 ~comp_m1_st~0)) (.cse1 (<= 0 ~z_val~0)) (.cse2 (<= 1 ~b0_val~0)) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (<= 2 ~b0_ev~0)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (<= 2 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse19 (= 0 ~d0_ev~0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-28 17:31:05,885 INFO L246 CegarLoopResult]: For program point L51(lines 41 91) no Hoare annotation was computed. [2019-11-28 17:31:05,885 INFO L246 CegarLoopResult]: For program point L349-1(lines 343 371) no Hoare annotation was computed. [2019-11-28 17:31:05,885 INFO L246 CegarLoopResult]: For program point L316-1(lines 310 338) no Hoare annotation was computed. [2019-11-28 17:31:05,885 INFO L246 CegarLoopResult]: For program point L349-3(lines 343 371) no Hoare annotation was computed. [2019-11-28 17:31:05,885 INFO L246 CegarLoopResult]: For program point L316-3(lines 310 338) no Hoare annotation was computed. [2019-11-28 17:31:05,885 INFO L246 CegarLoopResult]: For program point L52(lines 52 56) no Hoare annotation was computed. [2019-11-28 17:31:05,885 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 17:31:05,886 INFO L242 CegarLoopResult]: At program point L119(lines 96 121) the Hoare annotation is: (let ((.cse3 (= ~b1_ev~0 1)) (.cse18 (<= 2 ~d0_ev~0)) (.cse19 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (= ~b0_ev~0 1)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (= 1 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse19 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse19 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-28 17:31:05,886 INFO L242 CegarLoopResult]: At program point L119-1(lines 96 121) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 1 ~d0_ev~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 17:31:05,886 INFO L242 CegarLoopResult]: At program point L285(lines 275 300) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 17:31:05,887 INFO L242 CegarLoopResult]: At program point L120(lines 93 122) the Hoare annotation is: (let ((.cse3 (= ~b1_ev~0 1)) (.cse18 (<= 2 ~d0_ev~0)) (.cse19 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (= ~b0_ev~0 1)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (= 1 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse19 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse19 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-28 17:31:05,887 INFO L242 CegarLoopResult]: At program point L120-1(lines 93 122) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 1 ~d0_ev~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 17:31:05,887 INFO L246 CegarLoopResult]: For program point L187(lines 187 192) no Hoare annotation was computed. [2019-11-28 17:31:05,887 INFO L246 CegarLoopResult]: For program point L187-2(lines 187 192) no Hoare annotation was computed. [2019-11-28 17:31:05,887 INFO L246 CegarLoopResult]: For program point L187-3(lines 187 192) no Hoare annotation was computed. [2019-11-28 17:31:05,887 INFO L246 CegarLoopResult]: For program point L187-5(lines 187 192) no Hoare annotation was computed. [2019-11-28 17:31:05,887 INFO L246 CegarLoopResult]: For program point L354-1(lines 343 371) no Hoare annotation was computed. [2019-11-28 17:31:05,887 INFO L246 CegarLoopResult]: For program point L321-1(lines 310 338) no Hoare annotation was computed. [2019-11-28 17:31:05,888 INFO L246 CegarLoopResult]: For program point L354-3(lines 343 371) no Hoare annotation was computed. [2019-11-28 17:31:05,888 INFO L246 CegarLoopResult]: For program point L321-3(lines 310 338) no Hoare annotation was computed. [2019-11-28 17:31:05,888 INFO L246 CegarLoopResult]: For program point L289(lines 289 296) no Hoare annotation was computed. [2019-11-28 17:31:05,888 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 17:31:05,888 INFO L242 CegarLoopResult]: At program point L223(lines 201 239) the Hoare annotation is: (let ((.cse18 (= ~b1_ev~0 0)) (.cse9 (= 0 ~d0_ev~0)) (.cse20 (= ~b0_ev~0 0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-28 17:31:05,888 INFO L242 CegarLoopResult]: At program point L223-1(lines 201 239) the Hoare annotation is: (let ((.cse3 (<= 2 ~d0_ev~0)) (.cse18 (not (= ~z_req_up~0 1))) (.cse0 (<= 2 ~comp_m1_st~0)) (.cse1 (<= 0 ~z_val~0)) (.cse2 (<= 1 ~b0_val~0)) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (<= 2 ~b0_ev~0)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (<= 2 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse19 (= 0 ~d0_ev~0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-28 17:31:05,889 INFO L246 CegarLoopResult]: For program point L157(lines 157 162) no Hoare annotation was computed. [2019-11-28 17:31:05,889 INFO L246 CegarLoopResult]: For program point L157-2(lines 157 162) no Hoare annotation was computed. [2019-11-28 17:31:05,889 INFO L246 CegarLoopResult]: For program point L157-3(lines 157 162) no Hoare annotation was computed. [2019-11-28 17:31:05,889 INFO L246 CegarLoopResult]: For program point L157-5(lines 157 162) no Hoare annotation was computed. [2019-11-28 17:31:05,889 INFO L242 CegarLoopResult]: At program point L422-1(lines 340 444) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-28 17:31:05,889 INFO L246 CegarLoopResult]: For program point L423(line 423) no Hoare annotation was computed. [2019-11-28 17:31:05,889 INFO L246 CegarLoopResult]: For program point L258(lines 258 263) no Hoare annotation was computed. [2019-11-28 17:31:05,889 INFO L246 CegarLoopResult]: For program point L258-1(lines 258 263) no Hoare annotation was computed. [2019-11-28 17:31:05,889 INFO L246 CegarLoopResult]: For program point L127(lines 127 132) no Hoare annotation was computed. [2019-11-28 17:31:05,889 INFO L246 CegarLoopResult]: For program point L127-2(lines 127 132) no Hoare annotation was computed. [2019-11-28 17:31:05,890 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 17:31:05,890 INFO L246 CegarLoopResult]: For program point L127-3(lines 127 132) no Hoare annotation was computed. [2019-11-28 17:31:05,890 INFO L246 CegarLoopResult]: For program point L127-5(lines 127 132) no Hoare annotation was computed. [2019-11-28 17:31:05,890 INFO L249 CegarLoopResult]: At program point L491(lines 491 497) the Hoare annotation is: true [2019-11-28 17:31:05,890 INFO L246 CegarLoopResult]: For program point L359-1(lines 343 371) no Hoare annotation was computed. [2019-11-28 17:31:05,890 INFO L246 CegarLoopResult]: For program point L326-1(lines 310 338) no Hoare annotation was computed. [2019-11-28 17:31:05,890 INFO L246 CegarLoopResult]: For program point L359-3(lines 343 371) no Hoare annotation was computed. [2019-11-28 17:31:05,890 INFO L246 CegarLoopResult]: For program point L326-3(lines 310 338) no Hoare annotation was computed. [2019-11-28 17:31:05,890 INFO L246 CegarLoopResult]: For program point L63(lines 63 67) no Hoare annotation was computed. [2019-11-28 17:31:05,890 INFO L246 CegarLoopResult]: For program point L63-2(lines 41 91) no Hoare annotation was computed. [2019-11-28 17:31:05,891 INFO L246 CegarLoopResult]: For program point L97(lines 97 117) no Hoare annotation was computed. [2019-11-28 17:31:05,891 INFO L246 CegarLoopResult]: For program point L97-1(lines 97 117) no Hoare annotation was computed. [2019-11-28 17:31:05,891 INFO L242 CegarLoopResult]: At program point L230(lines 245 249) the Hoare annotation is: (let ((.cse18 (= ~b1_ev~0 0)) (.cse9 (= 0 ~d0_ev~0)) (.cse20 (= ~b0_ev~0 0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-28 17:31:05,891 INFO L242 CegarLoopResult]: At program point L230-1(lines 198 240) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~d0_ev~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 17:31:05,891 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 17:31:05,891 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-28 17:31:05,892 INFO L246 CegarLoopResult]: For program point L397(lines 397 402) no Hoare annotation was computed. [2019-11-28 17:31:05,892 INFO L242 CegarLoopResult]: At program point L331-1(lines 307 339) the Hoare annotation is: (let ((.cse3 (= ~b1_ev~0 1)) (.cse18 (<= 2 ~d0_ev~0)) (.cse19 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (= ~b0_ev~0 1)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (= 1 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse19 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse19 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-28 17:31:05,892 INFO L242 CegarLoopResult]: At program point L265(lines 257 267) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 17:31:05,892 INFO L242 CegarLoopResult]: At program point L364-3(lines 340 372) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-28 17:31:05,893 INFO L242 CegarLoopResult]: At program point L331-3(lines 307 339) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 1 ~d0_ev~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 17:31:05,893 INFO L242 CegarLoopResult]: At program point L265-1(lines 257 267) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-28 17:31:05,893 INFO L242 CegarLoopResult]: At program point L266(lines 254 268) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 17:31:05,893 INFO L242 CegarLoopResult]: At program point L266-1(lines 254 268) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-28 17:31:05,893 INFO L246 CegarLoopResult]: For program point L101(lines 101 116) no Hoare annotation was computed. [2019-11-28 17:31:05,893 INFO L246 CegarLoopResult]: For program point L101-1(lines 101 116) no Hoare annotation was computed. [2019-11-28 17:31:06,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:31:06 BoogieIcfgContainer [2019-11-28 17:31:06,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:31:06,017 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:31:06,017 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:31:06,018 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:31:06,018 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:30:43" (3/4) ... [2019-11-28 17:31:06,022 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 17:31:06,049 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 17:31:06,050 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 17:31:06,225 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:31:06,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:31:06,227 INFO L168 Benchmark]: Toolchain (without parser) took 23894.51 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 621.8 MB). Free memory was 961.7 MB in the beginning and 1.6 GB in the end (delta: -633.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:31:06,228 INFO L168 Benchmark]: CDTParser took 0.73 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:31:06,228 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:06,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:31:06,229 INFO L168 Benchmark]: Boogie Preprocessor took 33.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:06,230 INFO L168 Benchmark]: RCFGBuilder took 629.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:06,230 INFO L168 Benchmark]: TraceAbstraction took 22527.43 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 488.1 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -528.8 MB). Peak memory consumption was 700.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:06,231 INFO L168 Benchmark]: Witness Printer took 208.63 ms. Allocated memory is still 1.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:06,236 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.73 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 439.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 629.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22527.43 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 488.1 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -528.8 MB). Peak memory consumption was 700.9 MB. Max. memory is 11.5 GB. * Witness Printer took 208.63 ms. Allocated memory is still 1.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && b0_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && 1 == b1_req_up) && 2 <= z_ev) && d0_req_up == 1 - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 483]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && d0_req_up == 1) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && d0_req_up == 1)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && d0_req_up == 1)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && d0_req_up == 1) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 1 == b1_req_up) && 2 <= z_ev) && d0_req_up == 1) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 1 == b1_req_up) && 2 <= z_ev) && d0_req_up == 1) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: (z_val == 0 && b0_req_up <= 0) && b1_req_up <= 0 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. Result: SAFE, OverallTime: 6.4s, OverallIterations: 28, TraceHistogramMax: 2, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.9s, HoareTripleCheckerStatistics: 4818 SDtfs, 2658 SDslu, 3080 SDs, 0 SdLazy, 294 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1628occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 2531 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 366 NumberOfFragments, 5972 HoareAnnotationTreeSize, 33 FomulaSimplifications, 63852 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 33 FomulaSimplificationsInter, 32535 FormulaSimplificationTreeSizeReductionInter, 13.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2277 NumberOfCodeBlocks, 2277 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2248 ConstructedInterpolants, 0 QuantifiedInterpolants, 343948 SizeOfPredicates, 1 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 29 InterpolantComputations, 28 PerfectInterpolantSequences, 54/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...