./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 eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 17:34:45,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 17:34:45,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 17:34:45,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 17:34:45,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 17:34:45,598 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 17:34:45,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 17:34:45,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 17:34:45,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 17:34:45,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 17:34:45,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 17:34:45,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 17:34:45,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 17:34:45,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 17:34:45,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 17:34:45,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 17:34:45,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 17:34:45,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 17:34:45,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 17:34:45,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 17:34:45,621 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 17:34:45,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 17:34:45,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 17:34:45,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 17:34:45,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 17:34:45,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 17:34:45,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 17:34:45,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 17:34:45,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 17:34:45,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 17:34:45,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 17:34:45,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 17:34:45,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 17:34:45,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 17:34:45,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 17:34:45,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 17:34:45,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 17:34:45,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 17:34:45,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 17:34:45,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 17:34:45,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 17:34:45,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 17:34:45,638 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 17:34:45,661 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 17:34:45,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 17:34:45,662 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 17:34:45,662 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 17:34:45,662 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 17:34:45,662 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 17:34:45,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 17:34:45,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 17:34:45,663 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 17:34:45,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 17:34:45,664 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 17:34:45,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 17:34:45,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 17:34:45,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 17:34:45,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 17:34:45,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 17:34:45,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 17:34:45,665 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 17:34:45,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 17:34:45,666 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 17:34:45,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 17:34:45,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 17:34:45,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 17:34:45,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 17:34:45,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:34:45,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 17:34:45,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 17:34:45,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 17:34:45,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 17:34:45,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 17:34:45,668 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 17:34:45,668 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 17:34:45,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 17:34:45,668 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 [2022-07-19 17:34:45,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 17:34:45,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 17:34:45,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 17:34:45,881 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 17:34:45,881 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 17:34:45,882 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/bist_cell.cil.c [2022-07-19 17:34:45,921 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/698254fb4/44d3997b207c4f3f979558e0f19c7ef1/FLAGb12f993ff [2022-07-19 17:34:46,315 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 17:34:46,315 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c [2022-07-19 17:34:46,332 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/698254fb4/44d3997b207c4f3f979558e0f19c7ef1/FLAGb12f993ff [2022-07-19 17:34:46,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/698254fb4/44d3997b207c4f3f979558e0f19c7ef1 [2022-07-19 17:34:46,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 17:34:46,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 17:34:46,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 17:34:46,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 17:34:46,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 17:34:46,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:34:46" (1/1) ... [2022-07-19 17:34:46,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a69cf6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:46, skipping insertion in model container [2022-07-19 17:34:46,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:34:46" (1/1) ... [2022-07-19 17:34:46,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 17:34:46,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 17:34:46,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2022-07-19 17:34:46,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:34:46,574 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 17:34:46,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2022-07-19 17:34:46,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:34:46,627 INFO L208 MainTranslator]: Completed translation [2022-07-19 17:34:46,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:46 WrapperNode [2022-07-19 17:34:46,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 17:34:46,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 17:34:46,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 17:34:46,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 17:34:46,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:46" (1/1) ... [2022-07-19 17:34:46,649 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:46" (1/1) ... [2022-07-19 17:34:46,671 INFO L137 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 229 [2022-07-19 17:34:46,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 17:34:46,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 17:34:46,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 17:34:46,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 17:34:46,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:46" (1/1) ... [2022-07-19 17:34:46,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:46" (1/1) ... [2022-07-19 17:34:46,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:46" (1/1) ... [2022-07-19 17:34:46,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:46" (1/1) ... [2022-07-19 17:34:46,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:46" (1/1) ... [2022-07-19 17:34:46,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:46" (1/1) ... [2022-07-19 17:34:46,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:46" (1/1) ... [2022-07-19 17:34:46,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 17:34:46,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 17:34:46,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 17:34:46,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 17:34:46,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:46" (1/1) ... [2022-07-19 17:34:46,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:34:46,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:46,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 17:34:46,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 17:34:46,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 17:34:46,808 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-07-19 17:34:46,809 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-07-19 17:34:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-07-19 17:34:46,809 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-07-19 17:34:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-07-19 17:34:46,809 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-07-19 17:34:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-07-19 17:34:46,812 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-07-19 17:34:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 17:34:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-07-19 17:34:46,812 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-07-19 17:34:46,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 17:34:46,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 17:34:46,882 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 17:34:46,883 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 17:34:47,174 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 17:34:47,179 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 17:34:47,184 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 17:34:47,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:34:47 BoogieIcfgContainer [2022-07-19 17:34:47,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 17:34:47,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 17:34:47,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 17:34:47,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 17:34:47,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 05:34:46" (1/3) ... [2022-07-19 17:34:47,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e3ceb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:34:47, skipping insertion in model container [2022-07-19 17:34:47,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:46" (2/3) ... [2022-07-19 17:34:47,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e3ceb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:34:47, skipping insertion in model container [2022-07-19 17:34:47,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:34:47" (3/3) ... [2022-07-19 17:34:47,192 INFO L111 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2022-07-19 17:34:47,200 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 17:34:47,201 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 17:34:47,241 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 17:34:47,245 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@472e66e9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@52d24fe4 [2022-07-19 17:34:47,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 17:34:47,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 86 states have (on average 1.558139534883721) internal successors, (134), 88 states have internal predecessors, (134), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-19 17:34:47,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-19 17:34:47,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:47,254 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:34:47,254 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:47,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:47,257 INFO L85 PathProgramCache]: Analyzing trace with hash 129401130, now seen corresponding path program 1 times [2022-07-19 17:34:47,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:47,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467583233] [2022-07-19 17:34:47,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:47,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:47,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:47,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 17:34:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:47,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 17:34:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:47,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 17:34:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:34:47,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:47,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467583233] [2022-07-19 17:34:47,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467583233] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:47,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:34:47,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:34:47,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183145062] [2022-07-19 17:34:47,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:47,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:34:47,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:47,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:34:47,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:34:47,564 INFO L87 Difference]: Start difference. First operand has 103 states, 86 states have (on average 1.558139534883721) internal successors, (134), 88 states have internal predecessors, (134), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 17:34:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:48,074 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2022-07-19 17:34:48,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 17:34:48,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2022-07-19 17:34:48,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:48,083 INFO L225 Difference]: With dead ends: 281 [2022-07-19 17:34:48,083 INFO L226 Difference]: Without dead ends: 178 [2022-07-19 17:34:48,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-07-19 17:34:48,087 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 203 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:48,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 405 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:34:48,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-19 17:34:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 117. [2022-07-19 17:34:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.5) internal successors, (150), 101 states have internal predecessors, (150), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-07-19 17:34:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2022-07-19 17:34:48,120 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 42 [2022-07-19 17:34:48,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:48,120 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2022-07-19 17:34:48,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 17:34:48,121 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2022-07-19 17:34:48,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-19 17:34:48,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:48,123 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:48,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 17:34:48,124 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:48,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:48,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1179475252, now seen corresponding path program 1 times [2022-07-19 17:34:48,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:48,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655125502] [2022-07-19 17:34:48,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:48,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:34:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 17:34:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 17:34:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 17:34:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:34:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:34:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 17:34:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 17:34:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:34:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 17:34:48,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:48,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655125502] [2022-07-19 17:34:48,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655125502] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:48,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8121720] [2022-07-19 17:34:48,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:48,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:48,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:48,253 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:34:48,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 17:34:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 17:34:48,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:34:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-19 17:34:48,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:34:48,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8121720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:48,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:34:48,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-07-19 17:34:48,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937846055] [2022-07-19 17:34:48,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:48,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:34:48,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:48,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:34:48,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:34:48,393 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:34:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:48,406 INFO L93 Difference]: Finished difference Result 227 states and 333 transitions. [2022-07-19 17:34:48,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:34:48,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-07-19 17:34:48,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:48,408 INFO L225 Difference]: With dead ends: 227 [2022-07-19 17:34:48,408 INFO L226 Difference]: Without dead ends: 117 [2022-07-19 17:34:48,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:34:48,409 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 128 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:48,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 142 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:34:48,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-19 17:34:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-07-19 17:34:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.49) internal successors, (149), 101 states have internal predecessors, (149), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-07-19 17:34:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2022-07-19 17:34:48,421 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 101 [2022-07-19 17:34:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:48,421 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2022-07-19 17:34:48,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:34:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2022-07-19 17:34:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-19 17:34:48,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:48,424 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:48,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 17:34:48,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:48,641 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:48,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:48,642 INFO L85 PathProgramCache]: Analyzing trace with hash -779099534, now seen corresponding path program 1 times [2022-07-19 17:34:48,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:48,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341225239] [2022-07-19 17:34:48,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:48,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:34:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 17:34:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 17:34:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 17:34:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:34:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:34:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 17:34:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 17:34:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:34:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,774 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 17:34:48,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:48,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341225239] [2022-07-19 17:34:48,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341225239] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:48,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823198100] [2022-07-19 17:34:48,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:48,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:48,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:48,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:34:48,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 17:34:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:48,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 17:34:48,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:34:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 17:34:48,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:34:48,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823198100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:48,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:34:48,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-19 17:34:48,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686897319] [2022-07-19 17:34:48,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:48,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:34:48,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:48,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:34:48,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:34:48,944 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:34:49,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:49,067 INFO L93 Difference]: Finished difference Result 356 states and 529 transitions. [2022-07-19 17:34:49,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:34:49,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-07-19 17:34:49,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:49,069 INFO L225 Difference]: With dead ends: 356 [2022-07-19 17:34:49,069 INFO L226 Difference]: Without dead ends: 248 [2022-07-19 17:34:49,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:34:49,070 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 240 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:49,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 424 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:34:49,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-19 17:34:49,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 233. [2022-07-19 17:34:49,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 200 states have (on average 1.485) internal successors, (297), 203 states have internal predecessors, (297), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (27), 20 states have call predecessors, (27), 19 states have call successors, (27) [2022-07-19 17:34:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 343 transitions. [2022-07-19 17:34:49,088 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 343 transitions. Word has length 101 [2022-07-19 17:34:49,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:49,088 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 343 transitions. [2022-07-19 17:34:49,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:34:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 343 transitions. [2022-07-19 17:34:49,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-19 17:34:49,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:49,091 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:49,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 17:34:49,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-19 17:34:49,309 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:49,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:49,309 INFO L85 PathProgramCache]: Analyzing trace with hash -213976846, now seen corresponding path program 1 times [2022-07-19 17:34:49,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:49,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991064288] [2022-07-19 17:34:49,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:49,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:49,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:49,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:34:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:49,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 17:34:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:49,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 17:34:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:49,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 17:34:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:49,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:34:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:49,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:34:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:49,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 17:34:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:49,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 17:34:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:49,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:34:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 17:34:49,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:49,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991064288] [2022-07-19 17:34:49,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991064288] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:49,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212393090] [2022-07-19 17:34:49,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:49,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:49,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:49,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:34:49,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 17:34:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:49,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 17:34:49,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:34:49,582 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 17:34:49,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:34:49,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212393090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:49,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:34:49,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-19 17:34:49,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241743535] [2022-07-19 17:34:49,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:49,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:34:49,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:49,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:34:49,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:34:49,584 INFO L87 Difference]: Start difference. First operand 233 states and 343 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:34:49,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:49,731 INFO L93 Difference]: Finished difference Result 705 states and 1058 transitions. [2022-07-19 17:34:49,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:34:49,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-07-19 17:34:49,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:49,734 INFO L225 Difference]: With dead ends: 705 [2022-07-19 17:34:49,734 INFO L226 Difference]: Without dead ends: 485 [2022-07-19 17:34:49,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:34:49,736 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 237 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:49,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 412 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:34:49,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-07-19 17:34:49,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2022-07-19 17:34:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 402 states have (on average 1.472636815920398) internal successors, (592), 411 states have internal predecessors, (592), 37 states have call successors, (37), 21 states have call predecessors, (37), 29 states have return successors, (71), 40 states have call predecessors, (71), 37 states have call successors, (71) [2022-07-19 17:34:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 700 transitions. [2022-07-19 17:34:49,765 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 700 transitions. Word has length 101 [2022-07-19 17:34:49,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:49,766 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 700 transitions. [2022-07-19 17:34:49,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:34:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 700 transitions. [2022-07-19 17:34:49,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-19 17:34:49,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:49,769 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:49,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 17:34:49,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:49,986 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:49,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:49,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2077246898, now seen corresponding path program 1 times [2022-07-19 17:34:49,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:49,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726585293] [2022-07-19 17:34:49,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:49,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:34:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 17:34:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 17:34:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 17:34:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:34:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:34:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 17:34:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 17:34:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:34:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 17:34:50,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:50,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726585293] [2022-07-19 17:34:50,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726585293] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:50,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48078047] [2022-07-19 17:34:50,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:50,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:50,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:50,064 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:34:50,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 17:34:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 17:34:50,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:34:50,213 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 17:34:50,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:34:50,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48078047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:50,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:34:50,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-19 17:34:50,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269905356] [2022-07-19 17:34:50,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:50,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:34:50,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:50,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:34:50,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:34:50,215 INFO L87 Difference]: Start difference. First operand 469 states and 700 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:34:50,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:50,358 INFO L93 Difference]: Finished difference Result 1557 states and 2395 transitions. [2022-07-19 17:34:50,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:34:50,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-07-19 17:34:50,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:50,365 INFO L225 Difference]: With dead ends: 1557 [2022-07-19 17:34:50,365 INFO L226 Difference]: Without dead ends: 1109 [2022-07-19 17:34:50,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:34:50,368 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 250 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:50,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 452 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:34:50,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2022-07-19 17:34:50,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1021. [2022-07-19 17:34:50,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 880 states have (on average 1.45) internal successors, (1276), 907 states have internal predecessors, (1276), 73 states have call successors, (73), 41 states have call predecessors, (73), 67 states have return successors, (201), 80 states have call predecessors, (201), 73 states have call successors, (201) [2022-07-19 17:34:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1550 transitions. [2022-07-19 17:34:50,437 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1550 transitions. Word has length 101 [2022-07-19 17:34:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:50,439 INFO L495 AbstractCegarLoop]: Abstraction has 1021 states and 1550 transitions. [2022-07-19 17:34:50,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:34:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1550 transitions. [2022-07-19 17:34:50,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-19 17:34:50,443 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:50,443 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:50,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 17:34:50,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:50,670 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:50,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:50,670 INFO L85 PathProgramCache]: Analyzing trace with hash -300696526, now seen corresponding path program 1 times [2022-07-19 17:34:50,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:50,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039752661] [2022-07-19 17:34:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:50,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:34:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 17:34:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 17:34:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 17:34:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:34:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:34:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 17:34:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 17:34:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:34:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 17:34:50,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:50,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039752661] [2022-07-19 17:34:50,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039752661] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:50,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445287590] [2022-07-19 17:34:50,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:50,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:50,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:50,767 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:34:50,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 17:34:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:50,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 17:34:50,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:34:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 17:34:50,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:34:50,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445287590] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:50,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:34:50,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-19 17:34:50,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942444325] [2022-07-19 17:34:50,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:50,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:34:50,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:50,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:34:50,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:34:50,885 INFO L87 Difference]: Start difference. First operand 1021 states and 1550 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:34:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:51,058 INFO L93 Difference]: Finished difference Result 3377 states and 5343 transitions. [2022-07-19 17:34:51,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:34:51,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-07-19 17:34:51,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:51,086 INFO L225 Difference]: With dead ends: 3377 [2022-07-19 17:34:51,086 INFO L226 Difference]: Without dead ends: 2393 [2022-07-19 17:34:51,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:34:51,088 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 245 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:51,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 438 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:34:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2022-07-19 17:34:51,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2261. [2022-07-19 17:34:51,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 1954 states have (on average 1.4237461617195497) internal successors, (2782), 2035 states have internal predecessors, (2782), 145 states have call successors, (145), 81 states have call predecessors, (145), 161 states have return successors, (611), 160 states have call predecessors, (611), 145 states have call successors, (611) [2022-07-19 17:34:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3538 transitions. [2022-07-19 17:34:51,198 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3538 transitions. Word has length 101 [2022-07-19 17:34:51,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:51,199 INFO L495 AbstractCegarLoop]: Abstraction has 2261 states and 3538 transitions. [2022-07-19 17:34:51,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:34:51,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3538 transitions. [2022-07-19 17:34:51,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-19 17:34:51,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:51,205 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:51,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 17:34:51,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:51,422 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:51,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:51,423 INFO L85 PathProgramCache]: Analyzing trace with hash 38237618, now seen corresponding path program 1 times [2022-07-19 17:34:51,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:51,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949005362] [2022-07-19 17:34:51,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:51,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:51,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:51,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:34:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:51,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 17:34:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:51,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 17:34:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:51,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 17:34:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:51,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:34:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:51,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:34:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:51,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 17:34:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:51,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 17:34:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:51,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:34:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:51,488 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 17:34:51,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:51,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949005362] [2022-07-19 17:34:51,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949005362] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:51,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236274710] [2022-07-19 17:34:51,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:51,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:51,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:51,512 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:34:51,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 17:34:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:51,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 17:34:51,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:34:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:34:51,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:34:51,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236274710] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:51,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:34:51,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-07-19 17:34:51,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053743826] [2022-07-19 17:34:51,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:51,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:34:51,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:51,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:34:51,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-19 17:34:51,649 INFO L87 Difference]: Start difference. First operand 2261 states and 3538 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:34:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:51,759 INFO L93 Difference]: Finished difference Result 4789 states and 7470 transitions. [2022-07-19 17:34:51,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 17:34:51,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-07-19 17:34:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:51,768 INFO L225 Difference]: With dead ends: 4789 [2022-07-19 17:34:51,768 INFO L226 Difference]: Without dead ends: 2629 [2022-07-19 17:34:51,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-07-19 17:34:51,772 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 30 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:51,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 704 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:34:51,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2022-07-19 17:34:51,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2341. [2022-07-19 17:34:51,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2341 states, 2018 states have (on average 1.4103072348860257) internal successors, (2846), 2099 states have internal predecessors, (2846), 145 states have call successors, (145), 81 states have call predecessors, (145), 177 states have return successors, (643), 176 states have call predecessors, (643), 145 states have call successors, (643) [2022-07-19 17:34:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 3634 transitions. [2022-07-19 17:34:51,884 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 3634 transitions. Word has length 101 [2022-07-19 17:34:51,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:51,884 INFO L495 AbstractCegarLoop]: Abstraction has 2341 states and 3634 transitions. [2022-07-19 17:34:51,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:34:51,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 3634 transitions. [2022-07-19 17:34:51,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-19 17:34:51,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:51,891 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:51,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 17:34:52,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:52,126 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:52,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:52,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1425023028, now seen corresponding path program 1 times [2022-07-19 17:34:52,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:52,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833686401] [2022-07-19 17:34:52,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:52,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:34:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 17:34:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 17:34:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 17:34:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:34:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:34:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 17:34:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 17:34:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:34:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 17:34:52,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:52,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833686401] [2022-07-19 17:34:52,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833686401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:52,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435138888] [2022-07-19 17:34:52,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:52,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:52,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:52,207 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:34:52,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 17:34:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:34:52,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:34:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 17:34:52,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:34:52,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435138888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:52,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:34:52,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-07-19 17:34:52,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102289482] [2022-07-19 17:34:52,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:52,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:34:52,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:52,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:34:52,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:34:52,301 INFO L87 Difference]: Start difference. First operand 2341 states and 3634 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:34:52,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:52,404 INFO L93 Difference]: Finished difference Result 5110 states and 7919 transitions. [2022-07-19 17:34:52,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:34:52,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 101 [2022-07-19 17:34:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:52,413 INFO L225 Difference]: With dead ends: 5110 [2022-07-19 17:34:52,413 INFO L226 Difference]: Without dead ends: 2870 [2022-07-19 17:34:52,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:34:52,418 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 66 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:52,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 273 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:34:52,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2022-07-19 17:34:52,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2578. [2022-07-19 17:34:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2578 states, 2159 states have (on average 1.3756368689207967) internal successors, (2970), 2240 states have internal predecessors, (2970), 209 states have call successors, (209), 113 states have call predecessors, (209), 209 states have return successors, (788), 256 states have call predecessors, (788), 209 states have call successors, (788) [2022-07-19 17:34:52,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3967 transitions. [2022-07-19 17:34:52,543 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3967 transitions. Word has length 101 [2022-07-19 17:34:52,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:52,544 INFO L495 AbstractCegarLoop]: Abstraction has 2578 states and 3967 transitions. [2022-07-19 17:34:52,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:34:52,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3967 transitions. [2022-07-19 17:34:52,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-19 17:34:52,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:52,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:52,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 17:34:52,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:52,769 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:52,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash 457672374, now seen corresponding path program 1 times [2022-07-19 17:34:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:52,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767554611] [2022-07-19 17:34:52,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:34:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 17:34:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 17:34:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 17:34:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:34:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:34:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 17:34:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 17:34:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:34:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 17:34:52,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:52,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767554611] [2022-07-19 17:34:52,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767554611] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:52,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738219959] [2022-07-19 17:34:52,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:52,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:52,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:52,852 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:34:52,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 17:34:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:52,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 17:34:52,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:34:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-19 17:34:52,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:34:52,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738219959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:52,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:34:52,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-19 17:34:52,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86277966] [2022-07-19 17:34:52,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:52,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:34:52,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:52,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:34:52,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:34:52,979 INFO L87 Difference]: Start difference. First operand 2578 states and 3967 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:34:53,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:53,068 INFO L93 Difference]: Finished difference Result 5010 states and 7692 transitions. [2022-07-19 17:34:53,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:34:53,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-07-19 17:34:53,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:53,077 INFO L225 Difference]: With dead ends: 5010 [2022-07-19 17:34:53,077 INFO L226 Difference]: Without dead ends: 2658 [2022-07-19 17:34:53,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:34:53,082 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 9 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:53,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 554 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:34:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2022-07-19 17:34:53,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2626. [2022-07-19 17:34:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2207 states have (on average 1.3674671499773448) internal successors, (3018), 2288 states have internal predecessors, (3018), 209 states have call successors, (209), 113 states have call predecessors, (209), 209 states have return successors, (788), 256 states have call predecessors, (788), 209 states have call successors, (788) [2022-07-19 17:34:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4015 transitions. [2022-07-19 17:34:53,197 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 4015 transitions. Word has length 101 [2022-07-19 17:34:53,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:53,198 INFO L495 AbstractCegarLoop]: Abstraction has 2626 states and 4015 transitions. [2022-07-19 17:34:53,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:34:53,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 4015 transitions. [2022-07-19 17:34:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-19 17:34:53,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:53,204 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:53,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 17:34:53,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-19 17:34:53,422 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:53,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:53,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2122057235, now seen corresponding path program 1 times [2022-07-19 17:34:53,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:53,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267715126] [2022-07-19 17:34:53,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:53,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:53,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:53,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:34:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:53,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 17:34:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:53,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 17:34:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:53,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:34:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:53,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 17:34:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:53,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 17:34:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:53,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 17:34:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:53,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 17:34:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:53,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 17:34:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 17:34:53,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:53,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267715126] [2022-07-19 17:34:53,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267715126] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:53,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523210057] [2022-07-19 17:34:53,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:53,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:53,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:53,508 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:34:53,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 17:34:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:53,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:34:53,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:34:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 17:34:53,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:34:53,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523210057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:53,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:34:53,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-07-19 17:34:53,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522426709] [2022-07-19 17:34:53,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:53,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:34:53,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:53,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:34:53,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:34:53,595 INFO L87 Difference]: Start difference. First operand 2626 states and 4015 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:34:53,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:53,693 INFO L93 Difference]: Finished difference Result 5324 states and 8539 transitions. [2022-07-19 17:34:53,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:34:53,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2022-07-19 17:34:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:53,703 INFO L225 Difference]: With dead ends: 5324 [2022-07-19 17:34:53,704 INFO L226 Difference]: Without dead ends: 2908 [2022-07-19 17:34:53,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:34:53,710 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 17 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:53,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 281 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:34:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2022-07-19 17:34:53,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2908. [2022-07-19 17:34:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2908 states, 2393 states have (on average 1.3522774759715839) internal successors, (3236), 2474 states have internal predecessors, (3236), 273 states have call successors, (273), 145 states have call predecessors, (273), 241 states have return successors, (1046), 320 states have call predecessors, (1046), 273 states have call successors, (1046) [2022-07-19 17:34:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 4555 transitions. [2022-07-19 17:34:53,843 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 4555 transitions. Word has length 104 [2022-07-19 17:34:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:53,843 INFO L495 AbstractCegarLoop]: Abstraction has 2908 states and 4555 transitions. [2022-07-19 17:34:53,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:34:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 4555 transitions. [2022-07-19 17:34:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-19 17:34:53,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:53,851 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:53,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 17:34:54,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-19 17:34:54,069 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:54,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:54,069 INFO L85 PathProgramCache]: Analyzing trace with hash 163482449, now seen corresponding path program 1 times [2022-07-19 17:34:54,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:54,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232045047] [2022-07-19 17:34:54,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:54,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:54,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:54,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:34:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:54,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 17:34:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:54,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 17:34:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:54,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:34:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:54,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 17:34:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:54,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 17:34:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:54,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 17:34:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:54,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 17:34:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:54,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 17:34:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 17:34:54,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:54,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232045047] [2022-07-19 17:34:54,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232045047] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:54,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530197226] [2022-07-19 17:34:54,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:54,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:54,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:54,148 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:34:54,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 17:34:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:54,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 17:34:54,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:34:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 17:34:54,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:34:54,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530197226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:54,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:34:54,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-19 17:34:54,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511588129] [2022-07-19 17:34:54,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:54,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:34:54,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:54,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:34:54,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:34:54,298 INFO L87 Difference]: Start difference. First operand 2908 states and 4555 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:34:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:54,628 INFO L93 Difference]: Finished difference Result 9208 states and 15036 transitions. [2022-07-19 17:34:54,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 17:34:54,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2022-07-19 17:34:54,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:54,654 INFO L225 Difference]: With dead ends: 9208 [2022-07-19 17:34:54,654 INFO L226 Difference]: Without dead ends: 6558 [2022-07-19 17:34:54,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:34:54,663 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 210 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:54,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 769 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:34:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6558 states. [2022-07-19 17:34:54,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6558 to 6458. [2022-07-19 17:34:54,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6458 states, 5429 states have (on average 1.3494197826487382) internal successors, (7326), 5688 states have internal predecessors, (7326), 481 states have call successors, (481), 257 states have call predecessors, (481), 547 states have return successors, (2540), 576 states have call predecessors, (2540), 481 states have call successors, (2540) [2022-07-19 17:34:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 10347 transitions. [2022-07-19 17:34:55,009 INFO L78 Accepts]: Start accepts. Automaton has 6458 states and 10347 transitions. Word has length 104 [2022-07-19 17:34:55,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:55,009 INFO L495 AbstractCegarLoop]: Abstraction has 6458 states and 10347 transitions. [2022-07-19 17:34:55,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:34:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 6458 states and 10347 transitions. [2022-07-19 17:34:55,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-19 17:34:55,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:55,030 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:55,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 17:34:55,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-19 17:34:55,248 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:55,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:55,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1052671277, now seen corresponding path program 1 times [2022-07-19 17:34:55,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:55,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317574585] [2022-07-19 17:34:55,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:55,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:34:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 17:34:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 17:34:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:34:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 17:34:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 17:34:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 17:34:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 17:34:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 17:34:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 17:34:55,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:55,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317574585] [2022-07-19 17:34:55,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317574585] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:55,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16381248] [2022-07-19 17:34:55,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:55,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:55,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:55,335 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:34:55,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 17:34:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 17:34:55,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:34:55,436 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-19 17:34:55,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:34:55,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16381248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:55,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:34:55,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-07-19 17:34:55,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129550651] [2022-07-19 17:34:55,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:55,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:34:55,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:55,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:34:55,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:34:55,438 INFO L87 Difference]: Start difference. First operand 6458 states and 10347 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:34:55,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:55,767 INFO L93 Difference]: Finished difference Result 14114 states and 22261 transitions. [2022-07-19 17:34:55,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:34:55,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2022-07-19 17:34:55,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:55,796 INFO L225 Difference]: With dead ends: 14114 [2022-07-19 17:34:55,796 INFO L226 Difference]: Without dead ends: 7922 [2022-07-19 17:34:55,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-19 17:34:55,813 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 77 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:55,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 411 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:34:55,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2022-07-19 17:34:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 6458. [2022-07-19 17:34:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6458 states, 5429 states have (on average 1.3490513906796833) internal successors, (7324), 5688 states have internal predecessors, (7324), 481 states have call successors, (481), 257 states have call predecessors, (481), 547 states have return successors, (2540), 576 states have call predecessors, (2540), 481 states have call successors, (2540) [2022-07-19 17:34:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 10345 transitions. [2022-07-19 17:34:56,218 INFO L78 Accepts]: Start accepts. Automaton has 6458 states and 10345 transitions. Word has length 104 [2022-07-19 17:34:56,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:56,219 INFO L495 AbstractCegarLoop]: Abstraction has 6458 states and 10345 transitions. [2022-07-19 17:34:56,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:34:56,219 INFO L276 IsEmpty]: Start isEmpty. Operand 6458 states and 10345 transitions. [2022-07-19 17:34:56,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-19 17:34:56,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:56,246 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:56,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-19 17:34:56,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-19 17:34:56,463 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:56,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:56,464 INFO L85 PathProgramCache]: Analyzing trace with hash -611500932, now seen corresponding path program 1 times [2022-07-19 17:34:56,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:56,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761320148] [2022-07-19 17:34:56,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:56,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 17:34:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 17:34:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 17:34:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 17:34:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 17:34:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:34:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 17:34:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:34:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 17:34:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 17:34:56,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:56,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761320148] [2022-07-19 17:34:56,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761320148] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:56,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180485442] [2022-07-19 17:34:56,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:56,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:56,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:56,568 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:34:56,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 17:34:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:34:56,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:34:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 17:34:56,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:34:56,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180485442] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:56,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:34:56,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-07-19 17:34:56,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014582471] [2022-07-19 17:34:56,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:56,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:34:56,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:56,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:34:56,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:34:56,683 INFO L87 Difference]: Start difference. First operand 6458 states and 10345 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:34:57,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:57,032 INFO L93 Difference]: Finished difference Result 12874 states and 20913 transitions. [2022-07-19 17:34:57,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:34:57,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 107 [2022-07-19 17:34:57,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:57,058 INFO L225 Difference]: With dead ends: 12874 [2022-07-19 17:34:57,058 INFO L226 Difference]: Without dead ends: 6894 [2022-07-19 17:34:57,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:34:57,075 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 19 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:57,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 286 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:34:57,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6894 states. [2022-07-19 17:34:57,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6894 to 6894. [2022-07-19 17:34:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6894 states, 5721 states have (on average 1.340325117986366) internal successors, (7668), 5980 states have internal predecessors, (7668), 577 states have call successors, (577), 305 states have call predecessors, (577), 595 states have return successors, (2916), 672 states have call predecessors, (2916), 577 states have call successors, (2916) [2022-07-19 17:34:57,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6894 states to 6894 states and 11161 transitions. [2022-07-19 17:34:57,478 INFO L78 Accepts]: Start accepts. Automaton has 6894 states and 11161 transitions. Word has length 107 [2022-07-19 17:34:57,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:57,478 INFO L495 AbstractCegarLoop]: Abstraction has 6894 states and 11161 transitions. [2022-07-19 17:34:57,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:34:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand 6894 states and 11161 transitions. [2022-07-19 17:34:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-19 17:34:57,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:57,506 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:57,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-19 17:34:57,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-19 17:34:57,739 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:57,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:57,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1264981886, now seen corresponding path program 1 times [2022-07-19 17:34:57,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:57,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060703854] [2022-07-19 17:34:57,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:57,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 17:34:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 17:34:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 17:34:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 17:34:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 17:34:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:34:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 17:34:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:34:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 17:34:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 17:34:57,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:57,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060703854] [2022-07-19 17:34:57,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060703854] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:57,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929793759] [2022-07-19 17:34:57,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:57,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:57,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:57,856 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:34:57,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-19 17:34:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 17:34:57,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:34:57,995 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 17:34:57,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:34:57,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929793759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:57,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:34:57,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-19 17:34:57,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399103651] [2022-07-19 17:34:57,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:57,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:34:57,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:57,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:34:57,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:34:57,997 INFO L87 Difference]: Start difference. First operand 6894 states and 11161 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:34:58,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:58,354 INFO L93 Difference]: Finished difference Result 13370 states and 21103 transitions. [2022-07-19 17:34:58,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 17:34:58,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 107 [2022-07-19 17:34:58,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:58,373 INFO L225 Difference]: With dead ends: 13370 [2022-07-19 17:34:58,373 INFO L226 Difference]: Without dead ends: 7018 [2022-07-19 17:34:58,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:34:58,385 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 198 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:58,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 739 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:34:58,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7018 states. [2022-07-19 17:34:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7018 to 7014. [2022-07-19 17:34:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7014 states, 5817 states have (on average 1.3312704143029053) internal successors, (7744), 6100 states have internal predecessors, (7744), 577 states have call successors, (577), 305 states have call predecessors, (577), 619 states have return successors, (2560), 672 states have call predecessors, (2560), 577 states have call successors, (2560) [2022-07-19 17:34:58,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 10881 transitions. [2022-07-19 17:34:58,649 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 10881 transitions. Word has length 107 [2022-07-19 17:34:58,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:58,650 INFO L495 AbstractCegarLoop]: Abstraction has 7014 states and 10881 transitions. [2022-07-19 17:34:58,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:34:58,650 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 10881 transitions. [2022-07-19 17:34:58,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-19 17:34:58,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:58,681 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:58,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-19 17:34:58,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-19 17:34:58,898 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:58,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:58,898 INFO L85 PathProgramCache]: Analyzing trace with hash -549218888, now seen corresponding path program 2 times [2022-07-19 17:34:58,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:58,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533817571] [2022-07-19 17:34:58,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:58,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:58,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:58,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 17:34:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:59,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 17:34:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:59,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 17:34:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:59,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 17:34:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:59,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 17:34:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:59,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:34:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:59,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 17:34:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:59,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:34:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:59,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 17:34:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:59,020 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 17:34:59,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:59,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533817571] [2022-07-19 17:34:59,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533817571] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:59,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195398792] [2022-07-19 17:34:59,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 17:34:59,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:59,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:59,036 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:34:59,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-19 17:34:59,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 17:34:59,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:34:59,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 17:34:59,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:34:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 17:34:59,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:34:59,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195398792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:59,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:34:59,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-19 17:34:59,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251665207] [2022-07-19 17:34:59,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:59,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:34:59,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:59,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:34:59,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:34:59,156 INFO L87 Difference]: Start difference. First operand 7014 states and 10881 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 17:34:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:59,503 INFO L93 Difference]: Finished difference Result 10122 states and 18596 transitions. [2022-07-19 17:34:59,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 17:34:59,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 107 [2022-07-19 17:34:59,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:59,541 INFO L225 Difference]: With dead ends: 10122 [2022-07-19 17:34:59,541 INFO L226 Difference]: Without dead ends: 10118 [2022-07-19 17:34:59,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-19 17:34:59,550 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 117 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:59,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 759 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:34:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10118 states. [2022-07-19 17:35:00,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10118 to 7206. [2022-07-19 17:35:00,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7206 states, 6009 states have (on average 1.3206856382093526) internal successors, (7936), 6292 states have internal predecessors, (7936), 577 states have call successors, (577), 305 states have call predecessors, (577), 619 states have return successors, (2560), 672 states have call predecessors, (2560), 577 states have call successors, (2560) [2022-07-19 17:35:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7206 states to 7206 states and 11073 transitions. [2022-07-19 17:35:00,052 INFO L78 Accepts]: Start accepts. Automaton has 7206 states and 11073 transitions. Word has length 107 [2022-07-19 17:35:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:00,052 INFO L495 AbstractCegarLoop]: Abstraction has 7206 states and 11073 transitions. [2022-07-19 17:35:00,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 17:35:00,053 INFO L276 IsEmpty]: Start isEmpty. Operand 7206 states and 11073 transitions. [2022-07-19 17:35:00,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-19 17:35:00,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:00,068 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:00,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-19 17:35:00,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:00,297 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:00,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:00,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1225788474, now seen corresponding path program 1 times [2022-07-19 17:35:00,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:00,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129439346] [2022-07-19 17:35:00,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:00,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 17:35:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 17:35:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 17:35:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 17:35:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 17:35:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:35:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 17:35:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:35:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 17:35:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 17:35:00,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:00,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129439346] [2022-07-19 17:35:00,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129439346] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:00,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153669155] [2022-07-19 17:35:00,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:00,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:00,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:00,372 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:35:00,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-19 17:35:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 17:35:00,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:00,478 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 17:35:00,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:00,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153669155] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:00,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:00,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-07-19 17:35:00,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625313868] [2022-07-19 17:35:00,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:00,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:35:00,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:00,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:35:00,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-19 17:35:00,480 INFO L87 Difference]: Start difference. First operand 7206 states and 11073 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 17:35:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:00,738 INFO L93 Difference]: Finished difference Result 14926 states and 24105 transitions. [2022-07-19 17:35:00,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:35:00,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 107 [2022-07-19 17:35:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:00,765 INFO L225 Difference]: With dead ends: 14926 [2022-07-19 17:35:00,766 INFO L226 Difference]: Without dead ends: 8278 [2022-07-19 17:35:00,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:35:00,780 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 40 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:00,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 875 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:00,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8278 states. [2022-07-19 17:35:01,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8278 to 7110. [2022-07-19 17:35:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7110 states, 5913 states have (on average 1.3150684931506849) internal successors, (7776), 6196 states have internal predecessors, (7776), 577 states have call successors, (577), 305 states have call predecessors, (577), 619 states have return successors, (2560), 672 states have call predecessors, (2560), 577 states have call successors, (2560) [2022-07-19 17:35:01,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7110 states to 7110 states and 10913 transitions. [2022-07-19 17:35:01,177 INFO L78 Accepts]: Start accepts. Automaton has 7110 states and 10913 transitions. Word has length 107 [2022-07-19 17:35:01,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:01,177 INFO L495 AbstractCegarLoop]: Abstraction has 7110 states and 10913 transitions. [2022-07-19 17:35:01,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 17:35:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 7110 states and 10913 transitions. [2022-07-19 17:35:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-19 17:35:01,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:01,193 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:01,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-19 17:35:01,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-19 17:35:01,426 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:01,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:01,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1916204999, now seen corresponding path program 1 times [2022-07-19 17:35:01,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:01,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927660491] [2022-07-19 17:35:01,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:01,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 17:35:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 17:35:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 17:35:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 17:35:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 17:35:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:35:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 17:35:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:35:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 17:35:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 17:35:01,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:01,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927660491] [2022-07-19 17:35:01,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927660491] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:01,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438486709] [2022-07-19 17:35:01,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:01,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:01,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:01,516 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:35:01,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-19 17:35:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 17:35:01,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-19 17:35:01,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:01,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438486709] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:01,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:01,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-07-19 17:35:01,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969670168] [2022-07-19 17:35:01,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:01,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:35:01,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:01,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:35:01,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:35:01,614 INFO L87 Difference]: Start difference. First operand 7110 states and 10913 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:35:01,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:01,921 INFO L93 Difference]: Finished difference Result 15142 states and 23023 transitions. [2022-07-19 17:35:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:35:01,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 110 [2022-07-19 17:35:01,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:01,943 INFO L225 Difference]: With dead ends: 15142 [2022-07-19 17:35:01,943 INFO L226 Difference]: Without dead ends: 8334 [2022-07-19 17:35:01,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-19 17:35:01,959 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 79 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:01,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 393 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:35:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8334 states. [2022-07-19 17:35:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8334 to 7110. [2022-07-19 17:35:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7110 states, 5913 states have (on average 1.3143920175883645) internal successors, (7772), 6196 states have internal predecessors, (7772), 577 states have call successors, (577), 305 states have call predecessors, (577), 619 states have return successors, (2560), 672 states have call predecessors, (2560), 577 states have call successors, (2560) [2022-07-19 17:35:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7110 states to 7110 states and 10909 transitions. [2022-07-19 17:35:02,352 INFO L78 Accepts]: Start accepts. Automaton has 7110 states and 10909 transitions. Word has length 110 [2022-07-19 17:35:02,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:02,353 INFO L495 AbstractCegarLoop]: Abstraction has 7110 states and 10909 transitions. [2022-07-19 17:35:02,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:35:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 7110 states and 10909 transitions. [2022-07-19 17:35:02,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-19 17:35:02,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:02,368 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:02,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-19 17:35:02,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-19 17:35:02,584 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:02,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:02,585 INFO L85 PathProgramCache]: Analyzing trace with hash -406385611, now seen corresponding path program 1 times [2022-07-19 17:35:02,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:02,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867374880] [2022-07-19 17:35:02,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:02,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:02,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:02,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:35:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:02,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 17:35:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:02,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:35:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:02,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:35:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:02,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:35:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:02,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 17:35:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:02,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 17:35:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:02,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 17:35:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:02,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 17:35:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:02,683 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 17:35:02,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:02,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867374880] [2022-07-19 17:35:02,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867374880] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:02,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770246247] [2022-07-19 17:35:02,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:02,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:02,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:02,685 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:35:02,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-19 17:35:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:02,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:35:02,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-19 17:35:02,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:02,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770246247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:02,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:02,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-07-19 17:35:02,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54842620] [2022-07-19 17:35:02,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:02,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:35:02,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:02,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:35:02,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:35:02,768 INFO L87 Difference]: Start difference. First operand 7110 states and 10909 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:35:02,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:02,997 INFO L93 Difference]: Finished difference Result 14358 states and 22185 transitions. [2022-07-19 17:35:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:35:02,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 113 [2022-07-19 17:35:02,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:03,019 INFO L225 Difference]: With dead ends: 14358 [2022-07-19 17:35:03,020 INFO L226 Difference]: Without dead ends: 7774 [2022-07-19 17:35:03,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:35:03,033 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 21 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:03,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 286 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:03,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7774 states. [2022-07-19 17:35:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7774 to 7774. [2022-07-19 17:35:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7774 states, 6361 states have (on average 1.301682125451973) internal successors, (8280), 6644 states have internal predecessors, (8280), 721 states have call successors, (721), 377 states have call predecessors, (721), 691 states have return successors, (3000), 816 states have call predecessors, (3000), 721 states have call successors, (3000) [2022-07-19 17:35:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7774 states to 7774 states and 12001 transitions. [2022-07-19 17:35:03,486 INFO L78 Accepts]: Start accepts. Automaton has 7774 states and 12001 transitions. Word has length 113 [2022-07-19 17:35:03,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:03,487 INFO L495 AbstractCegarLoop]: Abstraction has 7774 states and 12001 transitions. [2022-07-19 17:35:03,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:35:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 7774 states and 12001 transitions. [2022-07-19 17:35:03,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-19 17:35:03,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:03,507 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:03,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-19 17:35:03,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-19 17:35:03,723 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:03,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:03,724 INFO L85 PathProgramCache]: Analyzing trace with hash -992661833, now seen corresponding path program 1 times [2022-07-19 17:35:03,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:03,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806841821] [2022-07-19 17:35:03,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:03,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:35:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 17:35:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:35:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:35:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:35:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 17:35:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 17:35:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 17:35:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 17:35:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 17:35:03,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:03,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806841821] [2022-07-19 17:35:03,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806841821] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:03,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641487531] [2022-07-19 17:35:03,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:03,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:03,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:03,796 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:35:03,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-19 17:35:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 17:35:03,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 17:35:03,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:03,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641487531] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:03,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:03,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-19 17:35:03,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304636983] [2022-07-19 17:35:03,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:03,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:35:03,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:03,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:35:03,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:35:03,953 INFO L87 Difference]: Start difference. First operand 7774 states and 12001 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:35:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:04,392 INFO L93 Difference]: Finished difference Result 15082 states and 22658 transitions. [2022-07-19 17:35:04,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 17:35:04,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 113 [2022-07-19 17:35:04,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:04,415 INFO L225 Difference]: With dead ends: 15082 [2022-07-19 17:35:04,415 INFO L226 Difference]: Without dead ends: 7922 [2022-07-19 17:35:04,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:35:04,431 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 194 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:04,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 696 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:35:04,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2022-07-19 17:35:04,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 7918. [2022-07-19 17:35:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7918 states, 6469 states have (on average 1.2916988715411966) internal successors, (8356), 6788 states have internal predecessors, (8356), 721 states have call successors, (721), 377 states have call predecessors, (721), 727 states have return successors, (2680), 816 states have call predecessors, (2680), 721 states have call successors, (2680) [2022-07-19 17:35:04,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7918 states to 7918 states and 11757 transitions. [2022-07-19 17:35:04,898 INFO L78 Accepts]: Start accepts. Automaton has 7918 states and 11757 transitions. Word has length 113 [2022-07-19 17:35:04,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:04,898 INFO L495 AbstractCegarLoop]: Abstraction has 7918 states and 11757 transitions. [2022-07-19 17:35:04,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:35:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 7918 states and 11757 transitions. [2022-07-19 17:35:04,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-19 17:35:04,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:04,920 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:04,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-19 17:35:05,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:05,137 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:05,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:05,137 INFO L85 PathProgramCache]: Analyzing trace with hash -38721675, now seen corresponding path program 1 times [2022-07-19 17:35:05,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:05,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599445276] [2022-07-19 17:35:05,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:05,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:35:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 17:35:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:35:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:35:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:35:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 17:35:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 17:35:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 17:35:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 17:35:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,217 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 17:35:05,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:05,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599445276] [2022-07-19 17:35:05,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599445276] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:05,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765007098] [2022-07-19 17:35:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:05,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:05,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:05,238 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:35:05,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-19 17:35:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 17:35:05,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-19 17:35:05,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:05,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765007098] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:05,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:05,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-07-19 17:35:05,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636260852] [2022-07-19 17:35:05,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:05,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:35:05,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:05,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:35:05,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:35:05,345 INFO L87 Difference]: Start difference. First operand 7918 states and 11757 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:35:05,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:05,778 INFO L93 Difference]: Finished difference Result 16338 states and 24119 transitions. [2022-07-19 17:35:05,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:35:05,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 113 [2022-07-19 17:35:05,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:05,804 INFO L225 Difference]: With dead ends: 16338 [2022-07-19 17:35:05,805 INFO L226 Difference]: Without dead ends: 8782 [2022-07-19 17:35:05,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-19 17:35:05,822 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 81 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:05,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 375 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:35:05,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8782 states. [2022-07-19 17:35:06,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8782 to 7918. [2022-07-19 17:35:06,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7918 states, 6469 states have (on average 1.2904622043592517) internal successors, (8348), 6788 states have internal predecessors, (8348), 721 states have call successors, (721), 377 states have call predecessors, (721), 727 states have return successors, (2680), 816 states have call predecessors, (2680), 721 states have call successors, (2680) [2022-07-19 17:35:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7918 states to 7918 states and 11749 transitions. [2022-07-19 17:35:06,263 INFO L78 Accepts]: Start accepts. Automaton has 7918 states and 11749 transitions. Word has length 113 [2022-07-19 17:35:06,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:06,263 INFO L495 AbstractCegarLoop]: Abstraction has 7918 states and 11749 transitions. [2022-07-19 17:35:06,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:35:06,263 INFO L276 IsEmpty]: Start isEmpty. Operand 7918 states and 11749 transitions. [2022-07-19 17:35:06,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-19 17:35:06,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:06,281 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:06,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-19 17:35:06,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:06,498 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:06,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:06,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1693209122, now seen corresponding path program 1 times [2022-07-19 17:35:06,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:06,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691940335] [2022-07-19 17:35:06,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:06,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:06,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:06,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 17:35:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:06,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:35:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:06,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 17:35:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:06,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 17:35:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:06,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 17:35:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:06,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 17:35:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:06,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 17:35:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:06,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 17:35:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:06,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 17:35:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 17:35:06,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:06,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691940335] [2022-07-19 17:35:06,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691940335] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:06,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80040534] [2022-07-19 17:35:06,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:06,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:06,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:06,571 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:35:06,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-19 17:35:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:06,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:35:06,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:06,674 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 17:35:06,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:06,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80040534] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:06,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:06,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-19 17:35:06,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158799040] [2022-07-19 17:35:06,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:06,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:35:06,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:06,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:35:06,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 17:35:06,676 INFO L87 Difference]: Start difference. First operand 7918 states and 11749 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:35:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:06,953 INFO L93 Difference]: Finished difference Result 16238 states and 24098 transitions. [2022-07-19 17:35:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:35:06,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 116 [2022-07-19 17:35:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:06,977 INFO L225 Difference]: With dead ends: 16238 [2022-07-19 17:35:06,977 INFO L226 Difference]: Without dead ends: 8918 [2022-07-19 17:35:06,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 17:35:06,991 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 23 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:06,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 286 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:06,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8918 states. [2022-07-19 17:35:07,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8918 to 8918. [2022-07-19 17:35:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8918 states, 7145 states have (on average 1.2717984604618615) internal successors, (9087), 7464 states have internal predecessors, (9087), 937 states have call successors, (937), 485 states have call predecessors, (937), 835 states have return successors, (3216), 1032 states have call predecessors, (3216), 937 states have call successors, (3216) [2022-07-19 17:35:07,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8918 states to 8918 states and 13240 transitions. [2022-07-19 17:35:07,388 INFO L78 Accepts]: Start accepts. Automaton has 8918 states and 13240 transitions. Word has length 116 [2022-07-19 17:35:07,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:07,388 INFO L495 AbstractCegarLoop]: Abstraction has 8918 states and 13240 transitions. [2022-07-19 17:35:07,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:35:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 8918 states and 13240 transitions. [2022-07-19 17:35:07,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-19 17:35:07,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:07,408 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:07,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-19 17:35:07,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-19 17:35:07,642 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:07,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:07,642 INFO L85 PathProgramCache]: Analyzing trace with hash -265365664, now seen corresponding path program 1 times [2022-07-19 17:35:07,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:07,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117562665] [2022-07-19 17:35:07,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:07,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 17:35:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:35:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 17:35:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 17:35:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 17:35:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 17:35:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 17:35:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 17:35:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 17:35:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,731 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 17:35:07,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:07,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117562665] [2022-07-19 17:35:07,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117562665] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:07,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328869873] [2022-07-19 17:35:07,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:07,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:07,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:07,733 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:35:07,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-19 17:35:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 17:35:07,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 17:35:07,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:07,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328869873] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:07,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:07,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2022-07-19 17:35:07,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834005565] [2022-07-19 17:35:07,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:07,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:35:07,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:07,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:35:07,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-19 17:35:07,865 INFO L87 Difference]: Start difference. First operand 8918 states and 13240 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:35:08,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:08,254 INFO L93 Difference]: Finished difference Result 17280 states and 24901 transitions. [2022-07-19 17:35:08,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 17:35:08,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 116 [2022-07-19 17:35:08,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:08,276 INFO L225 Difference]: With dead ends: 17280 [2022-07-19 17:35:08,276 INFO L226 Difference]: Without dead ends: 9084 [2022-07-19 17:35:08,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-19 17:35:08,350 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 190 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:08,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 668 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:35:08,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9084 states. [2022-07-19 17:35:08,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9084 to 9080. [2022-07-19 17:35:08,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9080 states, 7253 states have (on average 1.2596167103267613) internal successors, (9136), 7626 states have internal predecessors, (9136), 937 states have call successors, (937), 485 states have call predecessors, (937), 889 states have return successors, (2920), 1032 states have call predecessors, (2920), 937 states have call successors, (2920) [2022-07-19 17:35:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9080 states to 9080 states and 12993 transitions. [2022-07-19 17:35:08,742 INFO L78 Accepts]: Start accepts. Automaton has 9080 states and 12993 transitions. Word has length 116 [2022-07-19 17:35:08,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:08,742 INFO L495 AbstractCegarLoop]: Abstraction has 9080 states and 12993 transitions. [2022-07-19 17:35:08,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:35:08,743 INFO L276 IsEmpty]: Start isEmpty. Operand 9080 states and 12993 transitions. [2022-07-19 17:35:08,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-19 17:35:08,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:08,762 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:08,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-19 17:35:08,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-19 17:35:08,979 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:08,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:08,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1481519390, now seen corresponding path program 1 times [2022-07-19 17:35:08,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:08,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299505973] [2022-07-19 17:35:08,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:08,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 17:35:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:35:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 17:35:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 17:35:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 17:35:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 17:35:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 17:35:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 17:35:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 17:35:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 17:35:09,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:09,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299505973] [2022-07-19 17:35:09,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299505973] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:09,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464206938] [2022-07-19 17:35:09,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:09,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:09,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:09,044 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:35:09,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-19 17:35:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 17:35:09,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:09,162 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-19 17:35:09,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:09,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464206938] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:09,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:09,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2022-07-19 17:35:09,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750917927] [2022-07-19 17:35:09,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:09,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:35:09,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:09,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:35:09,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:35:09,164 INFO L87 Difference]: Start difference. First operand 9080 states and 12993 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:35:09,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:09,421 INFO L93 Difference]: Finished difference Result 14370 states and 20213 transitions. [2022-07-19 17:35:09,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:35:09,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 116 [2022-07-19 17:35:09,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:09,434 INFO L225 Difference]: With dead ends: 14370 [2022-07-19 17:35:09,434 INFO L226 Difference]: Without dead ends: 5904 [2022-07-19 17:35:09,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-19 17:35:09,447 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 96 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:09,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 463 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:09,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5904 states. [2022-07-19 17:35:09,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5904 to 5808. [2022-07-19 17:35:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5808 states, 4616 states have (on average 1.2606152512998268) internal successors, (5819), 4870 states have internal predecessors, (5819), 609 states have call successors, (609), 313 states have call predecessors, (609), 582 states have return successors, (1854), 656 states have call predecessors, (1854), 609 states have call successors, (1854) [2022-07-19 17:35:09,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5808 states to 5808 states and 8282 transitions. [2022-07-19 17:35:09,695 INFO L78 Accepts]: Start accepts. Automaton has 5808 states and 8282 transitions. Word has length 116 [2022-07-19 17:35:09,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:09,695 INFO L495 AbstractCegarLoop]: Abstraction has 5808 states and 8282 transitions. [2022-07-19 17:35:09,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:35:09,695 INFO L276 IsEmpty]: Start isEmpty. Operand 5808 states and 8282 transitions. [2022-07-19 17:35:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-19 17:35:09,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:09,705 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:09,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-07-19 17:35:09,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:09,922 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:09,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:09,922 INFO L85 PathProgramCache]: Analyzing trace with hash -961227544, now seen corresponding path program 1 times [2022-07-19 17:35:09,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:09,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611613145] [2022-07-19 17:35:09,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:09,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 17:35:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:35:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 17:35:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 17:35:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 17:35:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 17:35:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 17:35:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 17:35:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 17:35:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 17:35:09,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:09,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611613145] [2022-07-19 17:35:09,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611613145] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:09,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52050739] [2022-07-19 17:35:09,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:09,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:09,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:10,011 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:35:10,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-19 17:35:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:10,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 17:35:10,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:10,195 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-19 17:35:10,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:10,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52050739] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:10,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:10,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-19 17:35:10,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077994789] [2022-07-19 17:35:10,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:10,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:35:10,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:10,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:35:10,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:35:10,196 INFO L87 Difference]: Start difference. First operand 5808 states and 8282 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:35:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:10,431 INFO L93 Difference]: Finished difference Result 11110 states and 15539 transitions. [2022-07-19 17:35:10,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:35:10,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 116 [2022-07-19 17:35:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:10,442 INFO L225 Difference]: With dead ends: 11110 [2022-07-19 17:35:10,442 INFO L226 Difference]: Without dead ends: 5496 [2022-07-19 17:35:10,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-19 17:35:10,451 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 2 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:10,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 446 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:35:10,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5496 states. [2022-07-19 17:35:10,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5496 to 5496. [2022-07-19 17:35:10,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5496 states, 4460 states have (on average 1.2643497757847533) internal successors, (5639), 4698 states have internal predecessors, (5639), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-07-19 17:35:10,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5496 states to 5496 states and 7528 transitions. [2022-07-19 17:35:10,720 INFO L78 Accepts]: Start accepts. Automaton has 5496 states and 7528 transitions. Word has length 116 [2022-07-19 17:35:10,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:10,720 INFO L495 AbstractCegarLoop]: Abstraction has 5496 states and 7528 transitions. [2022-07-19 17:35:10,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:35:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 5496 states and 7528 transitions. [2022-07-19 17:35:10,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-19 17:35:10,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:10,729 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:10,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-19 17:35:10,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:10,944 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:10,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:10,944 INFO L85 PathProgramCache]: Analyzing trace with hash 230421370, now seen corresponding path program 1 times [2022-07-19 17:35:10,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:10,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955724668] [2022-07-19 17:35:10,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:10,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 17:35:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:35:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:35:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:35:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 17:35:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 17:35:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 17:35:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 17:35:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 17:35:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 17:35:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 17:35:11,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:11,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955724668] [2022-07-19 17:35:11,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955724668] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:11,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890666366] [2022-07-19 17:35:11,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:11,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:11,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:11,080 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:35:11,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-19 17:35:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 17:35:11,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 17:35:11,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:11,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890666366] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:11,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:11,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-19 17:35:11,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691838257] [2022-07-19 17:35:11,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:11,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:35:11,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:11,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:35:11,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-19 17:35:11,198 INFO L87 Difference]: Start difference. First operand 5496 states and 7528 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-19 17:35:11,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:11,411 INFO L93 Difference]: Finished difference Result 11630 states and 16840 transitions. [2022-07-19 17:35:11,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:35:11,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 131 [2022-07-19 17:35:11,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:11,428 INFO L225 Difference]: With dead ends: 11630 [2022-07-19 17:35:11,428 INFO L226 Difference]: Without dead ends: 6436 [2022-07-19 17:35:11,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-19 17:35:11,437 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 26 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:11,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 305 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6436 states. [2022-07-19 17:35:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6436 to 5544. [2022-07-19 17:35:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5544 states, 4508 states have (on average 1.2615350488021295) internal successors, (5687), 4746 states have internal predecessors, (5687), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-07-19 17:35:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7576 transitions. [2022-07-19 17:35:11,684 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7576 transitions. Word has length 131 [2022-07-19 17:35:11,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:11,684 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7576 transitions. [2022-07-19 17:35:11,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-19 17:35:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7576 transitions. [2022-07-19 17:35:11,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-19 17:35:11,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:11,693 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:11,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-19 17:35:11,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-19 17:35:11,907 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:11,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:11,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1879876967, now seen corresponding path program 1 times [2022-07-19 17:35:11,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:11,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658018032] [2022-07-19 17:35:11,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:11,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 17:35:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:35:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:35:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:35:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 17:35:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 17:35:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 17:35:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 17:35:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 17:35:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 17:35:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 17:35:11,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:11,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658018032] [2022-07-19 17:35:11,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658018032] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:11,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87279019] [2022-07-19 17:35:11,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:11,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:11,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:11,996 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:35:12,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-19 17:35:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:35:12,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 17:35:12,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:12,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87279019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:12,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:12,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-19 17:35:12,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146752341] [2022-07-19 17:35:12,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:12,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:35:12,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:12,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:35:12,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-19 17:35:12,119 INFO L87 Difference]: Start difference. First operand 5544 states and 7576 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-19 17:35:12,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:12,351 INFO L93 Difference]: Finished difference Result 11662 states and 16808 transitions. [2022-07-19 17:35:12,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:35:12,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 132 [2022-07-19 17:35:12,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:12,368 INFO L225 Difference]: With dead ends: 11662 [2022-07-19 17:35:12,368 INFO L226 Difference]: Without dead ends: 6420 [2022-07-19 17:35:12,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-19 17:35:12,377 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 30 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:12,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 310 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6420 states. [2022-07-19 17:35:12,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6420 to 5544. [2022-07-19 17:35:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5544 states, 4508 states have (on average 1.2508873114463177) internal successors, (5639), 4746 states have internal predecessors, (5639), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-07-19 17:35:12,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7528 transitions. [2022-07-19 17:35:12,626 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7528 transitions. Word has length 132 [2022-07-19 17:35:12,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:12,626 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7528 transitions. [2022-07-19 17:35:12,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-19 17:35:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7528 transitions. [2022-07-19 17:35:12,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-19 17:35:12,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:12,635 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:12,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-19 17:35:12,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-19 17:35:12,852 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:12,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:12,852 INFO L85 PathProgramCache]: Analyzing trace with hash 412574584, now seen corresponding path program 1 times [2022-07-19 17:35:12,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:12,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588303544] [2022-07-19 17:35:12,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:12,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 17:35:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:35:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:35:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:35:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 17:35:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 17:35:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 17:35:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 17:35:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 17:35:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 17:35:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 17:35:12,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:12,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588303544] [2022-07-19 17:35:12,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588303544] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:12,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581609094] [2022-07-19 17:35:12,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:12,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:12,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:12,946 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:35:12,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-19 17:35:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:13,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:35:13,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 17:35:13,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:13,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581609094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:13,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:13,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-07-19 17:35:13,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893007693] [2022-07-19 17:35:13,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:13,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:35:13,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:13,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:35:13,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-19 17:35:13,126 INFO L87 Difference]: Start difference. First operand 5544 states and 7528 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 17:35:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:13,449 INFO L93 Difference]: Finished difference Result 10786 states and 14542 transitions. [2022-07-19 17:35:13,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:35:13,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 132 [2022-07-19 17:35:13,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:13,460 INFO L225 Difference]: With dead ends: 10786 [2022-07-19 17:35:13,461 INFO L226 Difference]: Without dead ends: 5544 [2022-07-19 17:35:13,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-19 17:35:13,469 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 325 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:13,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 143 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5544 states. [2022-07-19 17:35:13,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5544 to 5544. [2022-07-19 17:35:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5544 states, 4508 states have (on average 1.247338065661047) internal successors, (5623), 4746 states have internal predecessors, (5623), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-07-19 17:35:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7512 transitions. [2022-07-19 17:35:13,796 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7512 transitions. Word has length 132 [2022-07-19 17:35:13,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:13,796 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7512 transitions. [2022-07-19 17:35:13,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 17:35:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7512 transitions. [2022-07-19 17:35:13,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-19 17:35:13,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:13,806 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:13,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-19 17:35:14,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-19 17:35:14,022 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:14,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:14,023 INFO L85 PathProgramCache]: Analyzing trace with hash -878588795, now seen corresponding path program 1 times [2022-07-19 17:35:14,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:14,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113559233] [2022-07-19 17:35:14,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:14,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 17:35:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:35:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:35:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:35:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 17:35:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 17:35:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 17:35:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 17:35:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 17:35:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 17:35:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 17:35:14,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:14,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113559233] [2022-07-19 17:35:14,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113559233] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:14,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234836489] [2022-07-19 17:35:14,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:14,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:14,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:14,160 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:35:14,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-19 17:35:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:35:14,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 17:35:14,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:14,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234836489] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:14,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:14,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-19 17:35:14,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276215829] [2022-07-19 17:35:14,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:14,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:35:14,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:14,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:35:14,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:35:14,265 INFO L87 Difference]: Start difference. First operand 5544 states and 7512 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-19 17:35:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:14,599 INFO L93 Difference]: Finished difference Result 11822 states and 16920 transitions. [2022-07-19 17:35:14,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:35:14,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 133 [2022-07-19 17:35:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:14,616 INFO L225 Difference]: With dead ends: 11822 [2022-07-19 17:35:14,616 INFO L226 Difference]: Without dead ends: 6580 [2022-07-19 17:35:14,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:35:14,625 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 34 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:14,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 307 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:14,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2022-07-19 17:35:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 5656. [2022-07-19 17:35:14,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5656 states, 4620 states have (on average 1.2482683982683982) internal successors, (5767), 4858 states have internal predecessors, (5767), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-07-19 17:35:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 7656 transitions. [2022-07-19 17:35:14,981 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 7656 transitions. Word has length 133 [2022-07-19 17:35:14,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:14,981 INFO L495 AbstractCegarLoop]: Abstraction has 5656 states and 7656 transitions. [2022-07-19 17:35:14,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-19 17:35:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 7656 transitions. [2022-07-19 17:35:14,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-19 17:35:14,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:14,991 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:15,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-07-19 17:35:15,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-19 17:35:15,200 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:15,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:15,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1371214969, now seen corresponding path program 1 times [2022-07-19 17:35:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:15,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298640566] [2022-07-19 17:35:15,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:15,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:15,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:15,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 17:35:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:15,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:35:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:15,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:35:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:15,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:35:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:15,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 17:35:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:15,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 17:35:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:15,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 17:35:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:15,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 17:35:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:15,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 17:35:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:15,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 17:35:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 17:35:15,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:15,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298640566] [2022-07-19 17:35:15,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298640566] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:15,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193284928] [2022-07-19 17:35:15,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:15,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:15,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:15,334 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:35:15,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-19 17:35:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:15,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:35:15,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 17:35:15,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:15,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193284928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:15,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:15,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-07-19 17:35:15,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637850451] [2022-07-19 17:35:15,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:15,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:35:15,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:15,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:35:15,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:35:15,531 INFO L87 Difference]: Start difference. First operand 5656 states and 7656 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 17:35:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:15,798 INFO L93 Difference]: Finished difference Result 11010 states and 14798 transitions. [2022-07-19 17:35:15,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:35:15,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 133 [2022-07-19 17:35:15,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:15,809 INFO L225 Difference]: With dead ends: 11010 [2022-07-19 17:35:15,809 INFO L226 Difference]: Without dead ends: 5656 [2022-07-19 17:35:15,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:35:15,817 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 318 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:15,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 160 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:15,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5656 states. [2022-07-19 17:35:16,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5656 to 5656. [2022-07-19 17:35:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5656 states, 4620 states have (on average 1.2413419913419914) internal successors, (5735), 4858 states have internal predecessors, (5735), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-07-19 17:35:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 7624 transitions. [2022-07-19 17:35:16,093 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 7624 transitions. Word has length 133 [2022-07-19 17:35:16,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:16,094 INFO L495 AbstractCegarLoop]: Abstraction has 5656 states and 7624 transitions. [2022-07-19 17:35:16,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 17:35:16,094 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 7624 transitions. [2022-07-19 17:35:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-19 17:35:16,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:16,102 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:16,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-07-19 17:35:16,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-19 17:35:16,319 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:16,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:16,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1497129402, now seen corresponding path program 1 times [2022-07-19 17:35:16,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:16,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015891935] [2022-07-19 17:35:16,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:16,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 17:35:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:35:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:35:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:35:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 17:35:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 17:35:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 17:35:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 17:35:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 17:35:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 17:35:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,410 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 17:35:16,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:16,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015891935] [2022-07-19 17:35:16,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015891935] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:16,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937184438] [2022-07-19 17:35:16,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:16,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:16,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:16,411 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:35:16,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-19 17:35:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:35:16,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:16,577 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 17:35:16,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:16,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937184438] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:16,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:16,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-07-19 17:35:16,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766607422] [2022-07-19 17:35:16,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:16,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:35:16,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:16,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:35:16,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:35:16,579 INFO L87 Difference]: Start difference. First operand 5656 states and 7624 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 17:35:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:16,857 INFO L93 Difference]: Finished difference Result 10898 states and 14606 transitions. [2022-07-19 17:35:16,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:35:16,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 134 [2022-07-19 17:35:16,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:16,868 INFO L225 Difference]: With dead ends: 10898 [2022-07-19 17:35:16,869 INFO L226 Difference]: Without dead ends: 5544 [2022-07-19 17:35:16,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:35:16,877 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 299 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:16,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 144 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:16,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5544 states. [2022-07-19 17:35:17,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5544 to 5544. [2022-07-19 17:35:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5544 states, 4508 states have (on average 1.236690328305235) internal successors, (5575), 4746 states have internal predecessors, (5575), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-07-19 17:35:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7464 transitions. [2022-07-19 17:35:17,216 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7464 transitions. Word has length 134 [2022-07-19 17:35:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:17,217 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7464 transitions. [2022-07-19 17:35:17,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 17:35:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7464 transitions. [2022-07-19 17:35:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-19 17:35:17,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:17,226 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:17,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-19 17:35:17,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:17,443 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:17,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:17,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1907659227, now seen corresponding path program 1 times [2022-07-19 17:35:17,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:17,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215932440] [2022-07-19 17:35:17,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:17,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 17:35:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:35:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:35:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:35:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:35:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:35:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 17:35:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 17:35:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 17:35:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 17:35:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-19 17:35:17,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:17,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215932440] [2022-07-19 17:35:17,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215932440] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:17,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:35:17,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:35:17,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770277155] [2022-07-19 17:35:17,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:17,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:35:17,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:17,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:35:17,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:35:17,514 INFO L87 Difference]: Start difference. First operand 5544 states and 7464 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 17:35:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:18,122 INFO L93 Difference]: Finished difference Result 12062 states and 17168 transitions. [2022-07-19 17:35:18,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 17:35:18,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2022-07-19 17:35:18,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:18,141 INFO L225 Difference]: With dead ends: 12062 [2022-07-19 17:35:18,141 INFO L226 Difference]: Without dead ends: 6820 [2022-07-19 17:35:18,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-19 17:35:18,151 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 222 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:18,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 395 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:35:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6820 states. [2022-07-19 17:35:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6820 to 5656. [2022-07-19 17:35:18,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5656 states, 4604 states have (on average 1.2317549956559513) internal successors, (5671), 4858 states have internal predecessors, (5671), 469 states have call successors, (469), 313 states have call predecessors, (469), 582 states have return successors, (1428), 500 states have call predecessors, (1428), 469 states have call successors, (1428) [2022-07-19 17:35:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 7568 transitions. [2022-07-19 17:35:18,475 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 7568 transitions. Word has length 135 [2022-07-19 17:35:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:18,476 INFO L495 AbstractCegarLoop]: Abstraction has 5656 states and 7568 transitions. [2022-07-19 17:35:18,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 17:35:18,476 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 7568 transitions. [2022-07-19 17:35:18,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-19 17:35:18,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:18,486 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:18,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-19 17:35:18,486 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:18,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:18,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1853266329, now seen corresponding path program 1 times [2022-07-19 17:35:18,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:18,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678073802] [2022-07-19 17:35:18,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:18,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:18,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:18,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 17:35:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:18,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:35:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:18,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:35:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:18,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:35:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:18,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:35:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:18,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:35:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:18,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 17:35:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:18,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 17:35:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:18,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 17:35:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:18,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 17:35:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 17:35:18,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:18,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678073802] [2022-07-19 17:35:18,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678073802] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:18,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:35:18,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 17:35:18,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221432952] [2022-07-19 17:35:18,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:18,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 17:35:18,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:18,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 17:35:18,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 17:35:18,561 INFO L87 Difference]: Start difference. First operand 5656 states and 7568 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 17:35:19,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:19,343 INFO L93 Difference]: Finished difference Result 13294 states and 18642 transitions. [2022-07-19 17:35:19,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 17:35:19,344 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2022-07-19 17:35:19,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:19,364 INFO L225 Difference]: With dead ends: 13294 [2022-07-19 17:35:19,365 INFO L226 Difference]: Without dead ends: 7940 [2022-07-19 17:35:19,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-07-19 17:35:19,375 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 287 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:19,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 492 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:35:19,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7940 states. [2022-07-19 17:35:19,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7940 to 7204. [2022-07-19 17:35:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7204 states, 5964 states have (on average 1.2459758551307847) internal successors, (7431), 6326 states have internal predecessors, (7431), 517 states have call successors, (517), 361 states have call predecessors, (517), 722 states have return successors, (2244), 532 states have call predecessors, (2244), 517 states have call successors, (2244) [2022-07-19 17:35:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7204 states to 7204 states and 10192 transitions. [2022-07-19 17:35:19,797 INFO L78 Accepts]: Start accepts. Automaton has 7204 states and 10192 transitions. Word has length 135 [2022-07-19 17:35:19,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:19,797 INFO L495 AbstractCegarLoop]: Abstraction has 7204 states and 10192 transitions. [2022-07-19 17:35:19,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 17:35:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 7204 states and 10192 transitions. [2022-07-19 17:35:19,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-19 17:35:19,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:19,807 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:19,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-19 17:35:19,807 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:19,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:19,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1576268195, now seen corresponding path program 1 times [2022-07-19 17:35:19,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:19,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343209238] [2022-07-19 17:35:19,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:19,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:19,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:19,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 17:35:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:19,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:35:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:19,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:35:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:19,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:35:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:19,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:35:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:19,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:35:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:19,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 17:35:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:19,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 17:35:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:19,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 17:35:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:19,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 17:35:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:19,882 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-19 17:35:19,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:19,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343209238] [2022-07-19 17:35:19,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343209238] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:19,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169237829] [2022-07-19 17:35:19,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:19,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:19,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:19,900 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:35:19,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-19 17:35:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:19,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 17:35:20,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:20,115 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 17:35:20,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:35:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-19 17:35:20,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169237829] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:35:20,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:35:20,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2022-07-19 17:35:20,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446862612] [2022-07-19 17:35:20,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:35:20,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 17:35:20,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:20,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 17:35:20,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:35:20,299 INFO L87 Difference]: Start difference. First operand 7204 states and 10192 transitions. Second operand has 13 states, 13 states have (on average 16.0) internal successors, (208), 10 states have internal predecessors, (208), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2022-07-19 17:35:22,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:22,041 INFO L93 Difference]: Finished difference Result 19309 states and 27520 transitions. [2022-07-19 17:35:22,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-19 17:35:22,041 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 16.0) internal successors, (208), 10 states have internal predecessors, (208), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 138 [2022-07-19 17:35:22,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:22,068 INFO L225 Difference]: With dead ends: 19309 [2022-07-19 17:35:22,068 INFO L226 Difference]: Without dead ends: 12287 [2022-07-19 17:35:22,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=473, Invalid=1689, Unknown=0, NotChecked=0, Total=2162 [2022-07-19 17:35:22,086 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 1530 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:22,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 480 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 17:35:22,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12287 states. [2022-07-19 17:35:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12287 to 11183. [2022-07-19 17:35:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11183 states, 9459 states have (on average 1.2225393804841949) internal successors, (11564), 9951 states have internal predecessors, (11564), 675 states have call successors, (675), 565 states have call predecessors, (675), 1048 states have return successors, (2589), 674 states have call predecessors, (2589), 675 states have call successors, (2589) [2022-07-19 17:35:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11183 states to 11183 states and 14828 transitions. [2022-07-19 17:35:22,733 INFO L78 Accepts]: Start accepts. Automaton has 11183 states and 14828 transitions. Word has length 138 [2022-07-19 17:35:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:22,733 INFO L495 AbstractCegarLoop]: Abstraction has 11183 states and 14828 transitions. [2022-07-19 17:35:22,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.0) internal successors, (208), 10 states have internal predecessors, (208), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2022-07-19 17:35:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 11183 states and 14828 transitions. [2022-07-19 17:35:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-19 17:35:22,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:22,741 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:22,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-19 17:35:22,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-19 17:35:22,951 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:22,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:22,952 INFO L85 PathProgramCache]: Analyzing trace with hash 700165149, now seen corresponding path program 1 times [2022-07-19 17:35:22,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:22,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415902678] [2022-07-19 17:35:22,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:22,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:23,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:23,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 17:35:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:23,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:35:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:23,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:35:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:23,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:35:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:23,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:35:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:23,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:35:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:23,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 17:35:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:23,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 17:35:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:23,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 17:35:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:23,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 17:35:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 17:35:23,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:23,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415902678] [2022-07-19 17:35:23,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415902678] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:23,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583379080] [2022-07-19 17:35:23,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:23,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:23,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:23,084 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:35:23,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-19 17:35:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:23,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:35:23,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 17:35:23,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:23,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583379080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:23,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:23,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-07-19 17:35:23,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096855018] [2022-07-19 17:35:23,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:23,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:35:23,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:23,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:35:23,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:35:23,239 INFO L87 Difference]: Start difference. First operand 11183 states and 14828 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 17:35:23,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:23,465 INFO L93 Difference]: Finished difference Result 14412 states and 18889 transitions. [2022-07-19 17:35:23,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:35:23,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 138 [2022-07-19 17:35:23,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:23,467 INFO L225 Difference]: With dead ends: 14412 [2022-07-19 17:35:23,467 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 17:35:23,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:35:23,481 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 208 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:23,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 170 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:23,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 17:35:23,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 17:35:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:35:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 17:35:23,482 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2022-07-19 17:35:23,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:23,483 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 17:35:23,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 17:35:23,483 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 17:35:23,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 17:35:23,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 17:35:23,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-07-19 17:35:23,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:23,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 17:35:47,548 WARN L233 SmtUtils]: Spent 7.11s on a formula simplification. DAG size of input: 989 DAG size of output: 88 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-07-19 17:36:08,010 WARN L233 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 529 DAG size of output: 163 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-07-19 17:36:18,073 INFO L895 garLoopResultBuilder]: At program point L129(lines 106 131) the Hoare annotation is: (let ((.cse14 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|)) (.cse0 (not (<= ~comp_m1_i~0 0))) (.cse1 (not (<= 1 ~d1_val_t~0))) (.cse2 (not (<= 1 ~d0_val_t~0))) (.cse3 (not (<= 2 ~b0_ev~0))) (.cse4 (not (= ~z_val~0 ~z_val_t~0))) (.cse5 (not (<= 2 ~z_ev~0))) (.cse6 (not (= ~z_val~0 0))) (.cse7 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse8 (not (<= ~d0_val_t~0 ~d0_val~0))) (.cse9 (not (<= 1 ~b0_val_t~0))) (.cse10 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse11 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse12 (not (<= 1 ~b1_val_t~0))) (.cse13 (<= 1 |activate_threads_is_method1_triggered_~__retres1~0#1|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~b1_ev~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (not (= ~d1_ev~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse4 (not (= ~b0_ev~0 1)) .cse5 .cse6 (and .cse14 .cse13) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 (not (= ~d0_ev~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-07-19 17:36:18,074 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2022-07-19 17:36:18,074 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 125) no Hoare annotation was computed. [2022-07-19 17:36:18,074 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2022-07-19 17:36:18,075 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 383 398) the Hoare annotation is: (let ((.cse0 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|)) (.cse1 (not (<= ~comp_m1_i~0 0))) (.cse2 (not (<= 1 ~d1_val_t~0))) (.cse3 (not (<= 1 ~d0_val_t~0))) (.cse4 (not (= ~z_val~0 ~z_val_t~0))) (.cse5 (not (<= 2 ~z_ev~0))) (.cse6 (not (= ~z_val~0 0))) (.cse7 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse8 (not (<= ~d0_val_t~0 ~d0_val~0))) (.cse9 (not (<= 1 ~b0_val_t~0))) (.cse10 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse11 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse12 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~b0_ev~0 1)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 (not (<= 2 ~b0_ev~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-07-19 17:36:18,075 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 127) no Hoare annotation was computed. [2022-07-19 17:36:18,075 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 383 398) no Hoare annotation was computed. [2022-07-19 17:36:18,075 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2022-07-19 17:36:18,075 INFO L899 garLoopResultBuilder]: For program point L390-2(lines 383 398) no Hoare annotation was computed. [2022-07-19 17:36:18,075 INFO L895 garLoopResultBuilder]: At program point L130(lines 103 132) the Hoare annotation is: (let ((.cse15 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|)) (.cse16 (<= 1 |activate_threads_is_method1_triggered_#res#1|)) (.cse17 (<= 1 |activate_threads_is_method1_triggered_~__retres1~0#1|))) (let ((.cse5 (and .cse15 .cse16 .cse17)) (.cse13 (and .cse16 .cse17)) (.cse0 (not (<= ~comp_m1_i~0 0))) (.cse1 (not (<= 1 ~d1_val_t~0))) (.cse2 (not (<= 1 ~d0_val_t~0))) (.cse14 (not (<= 2 ~b0_ev~0))) (.cse3 (not (= ~z_val~0 ~z_val_t~0))) (.cse4 (not (<= 2 ~z_ev~0))) (.cse6 (not (= ~z_val~0 0))) (.cse7 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse8 (not (<= ~d0_val_t~0 ~d0_val~0))) (.cse9 (not (<= 1 ~b0_val_t~0))) (.cse10 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse11 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse12 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~b0_ev~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse0 .cse1 .cse2 .cse14 (not (= ~d0_ev~0 1)) .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse15 .cse0 .cse1 .cse2 .cse14 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (not (= ~d1_ev~0 1)) .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse0 .cse1 .cse2 .cse14 .cse3 .cse4 (not (= ~b1_ev~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-07-19 17:36:18,075 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 264 278) no Hoare annotation was computed. [2022-07-19 17:36:18,076 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 273) no Hoare annotation was computed. [2022-07-19 17:36:18,076 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 264 278) the Hoare annotation is: true [2022-07-19 17:36:18,076 INFO L895 garLoopResultBuilder]: At program point L275(lines 267 277) the Hoare annotation is: (let ((.cse2 (not (<= ~d1_ev~0 0))) (.cse19 (not (<= 2 ~b1_ev~0))) (.cse20 (not (<= ~d0_ev~0 0))) (.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (<= ~comp_m1_i~0 0))) (.cse3 (not (<= 1 ~d1_val_t~0))) (.cse4 (not (<= 1 ~d0_val_t~0))) (.cse5 (not (<= 2 ~b0_ev~0))) (.cse6 (not (= ~z_val~0 ~z_val_t~0))) (.cse7 (not (<= 2 ~z_ev~0))) (.cse8 (not (= ~z_val~0 0))) (.cse18 (not (<= 2 ~d1_ev~0))) (.cse9 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse10 (not (<= ~d0_val_t~0 ~d0_val~0))) (.cse11 (not (<= 1 ~b0_val_t~0))) (.cse12 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse13 (<= 1 exists_runnable_thread_~__retres1~1)) (.cse14 (not (<= ~b1_ev~0 0))) (.cse15 (not (<= 2 ~d0_ev~0))) (.cse16 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse17 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse16 .cse20 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse20 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse20 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse16 .cse20 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2022-07-19 17:36:18,076 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 264 278) no Hoare annotation was computed. [2022-07-19 17:36:18,076 INFO L895 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 317 349) the Hoare annotation is: (let ((.cse22 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse23 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse24 (= |old(~z_ev~0)| ~z_ev~0)) (.cse25 (= |old(~b1_ev~0)| ~b1_ev~0))) (let ((.cse17 (not (<= |old(~d1_ev~0)| 0))) (.cse1 (not (= |old(~b0_ev~0)| 0))) (.cse8 (not (<= |old(~b1_ev~0)| 0))) (.cse20 (not (<= |old(~d0_ev~0)| 0))) (.cse14 (and .cse22 .cse23 .cse24 (= ~b0_ev~0 0) .cse25)) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse2 (not (<= ~comp_m1_i~0 0))) (.cse3 (not (<= 1 ~d1_val_t~0))) (.cse4 (not (<= 1 ~d0_val_t~0))) (.cse5 (not (<= 2 |old(~d1_ev~0)|))) (.cse6 (not (= ~z_val~0 ~z_val_t~0))) (.cse18 (and .cse22 (= ~b0_ev~0 |old(~b0_ev~0)|) .cse23 .cse24 .cse25)) (.cse7 (not (= ~z_val~0 0))) (.cse19 (not (<= 2 |old(~b1_ev~0)|))) (.cse9 (not (<= 2 |old(~d0_ev~0)|))) (.cse10 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse11 (not (<= ~d0_val_t~0 ~d0_val~0))) (.cse12 (not (<= 1 ~b0_val_t~0))) (.cse13 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse15 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse21 (not (<= 2 |old(~b0_ev~0)|))) (.cse16 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse17 .cse6 .cse18 .cse7 .cse19 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse21 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse19 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse17 .cse6 .cse18 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse21 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse17 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse21 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse17 .cse6 .cse18 .cse7 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse21 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse19 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse21 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse21 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse21 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse21 .cse16)))) [2022-07-19 17:36:18,077 INFO L899 garLoopResultBuilder]: For program point L341-1(lines 317 349) no Hoare annotation was computed. [2022-07-19 17:36:18,077 INFO L899 garLoopResultBuilder]: For program point L331-1(lines 320 348) no Hoare annotation was computed. [2022-07-19 17:36:18,077 INFO L899 garLoopResultBuilder]: For program point L321-1(lines 320 348) no Hoare annotation was computed. [2022-07-19 17:36:18,077 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 317 349) no Hoare annotation was computed. [2022-07-19 17:36:18,077 INFO L899 garLoopResultBuilder]: For program point L336-1(lines 320 348) no Hoare annotation was computed. [2022-07-19 17:36:18,077 INFO L899 garLoopResultBuilder]: For program point L326-1(lines 320 348) no Hoare annotation was computed. [2022-07-19 17:36:18,078 INFO L895 garLoopResultBuilder]: At program point L205(lines 193 207) the Hoare annotation is: (let ((.cse52 (<= ~d1_ev~0 0)) (.cse35 (<= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse37 (<= 2 ~d0_ev~0)) (.cse39 (<= |old(~d0_ev~0)| ~d0_ev~0)) (.cse54 (<= ~b1_ev~0 0)) (.cse32 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse27 (<= ~comp_m1_i~0 0)) (.cse57 (= ~z_val~0 ~z_val_t~0)) (.cse28 (<= 2 ~z_ev~0)) (.cse29 (<= 2 ~b1_ev~0)) (.cse53 (<= ~d0_ev~0 0)) (.cse58 (= |old(~z_val~0)| ~z_val~0)) (.cse30 (<= ~d0_val_t~0 ~d0_val~0)) (.cse31 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse59 (<= 1 ~d0_val_t~0)) (.cse56 (<= 1 ~b0_val_t~0)) (.cse33 (<= |old(~b1_ev~0)| ~b1_ev~0)) (.cse34 (<= 2 ~d1_ev~0)) (.cse36 (<= ~b1_val_t~0 ~b1_val~0)) (.cse38 (<= ~b0_val_t~0 ~b0_val~0)) (.cse55 (<= 1 ~b1_val_t~0)) (.cse40 (= ~z_val~0 0)) (.cse45 (<= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse41 (<= ~d1_val_t~0 ~d1_val~0)) (.cse60 (<= 1 ~d1_val_t~0)) (.cse42 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse46 (= ~b0_ev~0 0)) (.cse47 (<= ~b1_ev~0 |old(~b1_ev~0)|))) (let ((.cse10 (and .cse27 .cse57 .cse28 .cse29 .cse53 .cse58 .cse30 .cse31 .cse59 .cse56 .cse33 .cse34 .cse36 .cse38 .cse55 .cse40 .cse45 .cse41 .cse60 .cse42 .cse46 .cse47)) (.cse22 (and .cse27 .cse57 .cse28 .cse29 .cse53 .cse58 .cse30 .cse31 .cse59 .cse32 .cse33 .cse34 .cse36 .cse38 .cse40 .cse45 .cse41 .cse60 .cse42 .cse47)) (.cse2 (and .cse27 .cse57 .cse28 .cse54 .cse53 .cse58 .cse30 .cse31 .cse59 .cse34 .cse36 .cse38 .cse40 .cse45 .cse41 .cse60 .cse42 .cse46)) (.cse25 (and .cse27 .cse28 .cse54 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse45 .cse41 .cse42)) (.cse12 (and .cse27 .cse57 .cse28 .cse54 .cse53 .cse58 .cse30 .cse31 .cse59 .cse32 .cse34 .cse36 .cse38 .cse40 .cse45 .cse41 .cse60 .cse42)) (.cse44 (and .cse27 .cse57 .cse28 .cse54 .cse58 .cse30 .cse31 .cse59 .cse56 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse45 .cse41 .cse60 .cse42 .cse46)) (.cse5 (not (<= 2 |old(~d1_ev~0)|))) (.cse24 (and .cse27 .cse57 .cse28 .cse29 .cse30 .cse52 .cse31 .cse59 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse60 .cse47)) (.cse26 (and .cse27 .cse57 .cse28 .cse54 .cse58 .cse30 .cse52 .cse31 .cse59 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse60 .cse46)) (.cse11 (not (<= 2 |old(~b1_ev~0)|))) (.cse43 (not (<= 2 |old(~d0_ev~0)|))) (.cse13 (and .cse27 .cse28 .cse29 .cse53 .cse30 .cse52 .cse31 .cse32 .cse33 .cse36 .cse38 .cse40 .cse41 .cse47)) (.cse15 (and .cse27 .cse57 .cse28 .cse29 .cse53 .cse58 .cse30 .cse52 .cse31 .cse59 .cse56 .cse33 .cse36 .cse38 .cse40 .cse41 .cse60 .cse46 .cse47)) (.cse48 (and .cse27 .cse57 .cse28 .cse54 .cse58 .cse30 .cse52 .cse31 .cse59 .cse32 .cse56 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse60)) (.cse49 (and .cse27 .cse57 .cse28 .cse29 .cse58 .cse30 .cse52 .cse31 .cse59 .cse56 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse60 .cse46 .cse47)) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse1 (not .cse27)) (.cse3 (not .cse60)) (.cse4 (not .cse59)) (.cse50 (not (<= |old(~d1_ev~0)| 0))) (.cse6 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse7 (not (= |old(~z_val~0)| 0))) (.cse8 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse9 (and .cse27 .cse57 .cse28 .cse54 .cse53 .cse58 .cse30 .cse52 .cse31 .cse59 .cse56 .cse36 .cse38 .cse40 .cse41 .cse60 .cse46)) (.cse51 (not (<= |old(~b1_ev~0)| 0))) (.cse14 (not .cse56)) (.cse16 (not (<= |old(~d0_ev~0)| 0))) (.cse17 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse18 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse19 (not (<= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse20 (not (<= 2 |old(~b0_ev~0)|))) (.cse21 (and .cse27 .cse28 .cse54 .cse53 .cse30 .cse52 .cse31 .cse32 .cse36 .cse38 .cse40 .cse41)) (.cse23 (not .cse55))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse7 .cse8 .cse26 .cse9 (and .cse27 .cse28 (= ~d1_ev~0 |old(~d1_ev~0)|) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (= |old(~z_ev~0)| ~z_ev~0) .cse41 .cse42 (= |old(~b1_ev~0)| ~b1_ev~0)) .cse10 .cse11 .cse43 .cse12 .cse13 .cse14 .cse44 .cse15 (and .cse27 .cse28 .cse29 .cse30 .cse31 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse45 .cse41 .cse42 .cse46 .cse47) .cse17 .cse18 .cse48 .cse49 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse3 .cse4 .cse50 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse51 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse7 .cse8 .cse26 .cse9 .cse51 .cse43 .cse12 .cse14 .cse44 .cse17 .cse18 .cse48 .cse19 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse3 .cse4 .cse50 .cse6 .cse7 .cse8 .cse26 .cse9 .cse51 .cse43 .cse14 .cse17 .cse18 .cse48 .cse19 .cse20 .cse21 .cse23) (or (not (= ~comp_m1_st~0 0)) .cse0 .cse1 (and .cse30 .cse52 .cse31 .cse33 .cse35 .cse36 .cse38 .cse39 .cse40 .cse41 .cse46 .cse47) (and .cse53 .cse30 .cse31 .cse33 .cse36 .cse38 .cse40 .cse45 .cse41 .cse42 .cse46 .cse47) .cse3 .cse4 (and .cse53 .cse30 .cse52 .cse31 .cse33 .cse36 .cse38 .cse40 .cse41 .cse46 .cse47) (and .cse30 .cse31 .cse33 .cse35 .cse36 .cse38 .cse39 .cse40 .cse45 .cse41 .cse42 .cse46 .cse47) .cse5 .cse6 (not (= |old(~d0_req_up~0)| 1)) .cse7 (and .cse54 .cse53 .cse30 .cse31 .cse36 .cse38 .cse40 .cse45 .cse41 .cse42 .cse46) (and .cse54 .cse30 .cse52 .cse31 .cse35 .cse36 .cse38 .cse39 .cse40 .cse41 .cse46) .cse11 .cse43 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (and .cse54 .cse53 .cse30 .cse52 .cse31 .cse36 .cse38 .cse40 .cse41 .cse46) (not (= |old(~b1_req_up~0)| 1)) .cse20 (and .cse54 .cse30 .cse31 .cse35 .cse36 .cse38 .cse39 .cse40 .cse45 .cse41 .cse42 .cse46) .cse23) (or .cse0 .cse1 .cse3 .cse4 .cse50 .cse6 .cse24 .cse7 .cse8 .cse26 .cse9 .cse11 .cse43 .cse13 .cse14 .cse15 .cse17 .cse18 .cse48 .cse49 .cse19 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse3 .cse4 .cse50 .cse6 .cse7 .cse8 .cse9 .cse51 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23)))) [2022-07-19 17:36:18,078 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2022-07-19 17:36:18,078 INFO L899 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2022-07-19 17:36:18,078 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 211 249) no Hoare annotation was computed. [2022-07-19 17:36:18,079 INFO L895 garLoopResultBuilder]: At program point L160(lines 148 162) the Hoare annotation is: (let ((.cse40 (<= |old(~b1_ev~0)| ~b1_ev~0)) (.cse41 (<= ~b1_ev~0 |old(~b1_ev~0)|)) (.cse52 (<= 2 ~d1_ev~0)) (.cse55 (<= 2 ~b0_ev~0)) (.cse46 (= ~z_val~0 ~z_val_t~0)) (.cse48 (= |old(~z_val~0)| ~z_val~0)) (.cse57 (<= ~d1_ev~0 0)) (.cse50 (<= 1 ~d0_val_t~0)) (.cse44 (<= 1 ~b0_val_t~0)) (.cse56 (<= 1 ~d1_val_t~0)) (.cse38 (= ~b0_ev~0 0)) (.cse45 (<= ~comp_m1_i~0 0)) (.cse47 (<= 2 ~z_ev~0)) (.cse27 (<= ~b1_ev~0 0)) (.cse49 (<= ~d0_val_t~0 ~d0_val~0)) (.cse28 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse51 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse29 (<= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse30 (<= ~b1_val_t~0 ~b1_val~0)) (.cse31 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse53 (<= 2 ~d0_ev~0)) (.cse32 (<= ~b0_val_t~0 ~b0_val~0)) (.cse33 (<= |old(~d0_ev~0)| ~d0_ev~0)) (.cse34 (= ~z_val~0 0)) (.cse35 (<= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse54 (<= ~d1_val_t~0 ~d1_val~0)) (.cse36 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse37 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse39 (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (let ((.cse18 (and .cse45 .cse47 .cse27 .cse49 .cse28 .cse51 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse37 .cse39)) (.cse20 (and .cse45 .cse46 .cse47 .cse27 .cse48 .cse49 .cse57 .cse28 .cse50 .cse44 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse56 .cse37 .cse38 .cse39)) (.cse24 (and .cse45 .cse46 .cse47 .cse27 (<= ~d0_ev~0 0) .cse48 .cse49 .cse28 .cse50 .cse51 .cse44 .cse52 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse54 .cse55 .cse36 .cse56 .cse37 .cse39)) (.cse26 (and .cse45 .cse46 .cse47 .cse27 .cse49 .cse28 .cse50 .cse52 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse56 .cse37 .cse38 .cse39)) (.cse4 (not (<= |old(~d1_ev~0)| 0))) (.cse22 (and .cse49 .cse28 .cse40 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse37 .cse38 .cse39 .cse41)) (.cse9 (and .cse45 .cse46 .cse47 .cse27 .cse48 .cse49 .cse57 .cse28 .cse50 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse56 .cse37 .cse38 .cse39)) (.cse23 (not (<= 2 |old(~b1_ev~0)|))) (.cse11 (not (<= |old(~d0_ev~0)| 0))) (.cse25 (and (= ~d1_ev~0 |old(~d1_ev~0)|) .cse49 .cse51 .cse30 .cse31 .cse32 (= |old(~d0_ev~0)| ~d0_ev~0) .cse34 (= |old(~z_ev~0)| ~z_ev~0) .cse54 .cse36 (= |old(~b1_ev~0)| ~b1_ev~0) .cse39)) (.cse17 (and .cse45 .cse46 .cse47 .cse27 .cse48 .cse49 .cse57 .cse28 .cse50 .cse51 .cse44 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse56 .cse37 .cse39)) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse1 (not .cse45)) (.cse42 (and .cse45 .cse47 .cse27 .cse49 .cse28 .cse52 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse37 .cse38 .cse39)) (.cse2 (not .cse56)) (.cse3 (not .cse50)) (.cse21 (not (<= 2 |old(~d1_ev~0)|))) (.cse5 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse6 (not (= |old(~z_val~0)| 0))) (.cse7 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse8 (not (<= |old(~b1_ev~0)| 0))) (.cse19 (not (<= 2 |old(~d0_ev~0)|))) (.cse43 (and .cse45 .cse46 .cse47 .cse27 .cse48 .cse49 .cse28 .cse50 .cse51 .cse44 .cse52 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse54 .cse55 .cse36 .cse56 .cse37 .cse39)) (.cse10 (not .cse44)) (.cse12 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse13 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse14 (not (<= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse15 (not (<= 2 |old(~b0_ev~0)|))) (.cse16 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse10 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse22 .cse23 .cse10 .cse24 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse26 .cse16) (or (not (= ~comp_m1_st~0 0)) .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 (not (= |old(~d0_req_up~0)| 1)) .cse6 .cse23 .cse19 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (and .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) (not (= |old(~b1_req_up~0)| 1)) .cse15 (and .cse28 .cse40 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse41) .cse16) (or .cse0 .cse1 .cse42 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse22 .cse23 .cse19 .cse43 .cse10 .cse12 .cse13 .cse25 .cse14 .cse15 .cse16) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse22 .cse23 .cse19 .cse10 .cse20 .cse12 .cse13 .cse25 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse22 .cse9 .cse23 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse42 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse19 .cse43 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2022-07-19 17:36:18,079 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 157) no Hoare annotation was computed. [2022-07-19 17:36:18,079 INFO L899 garLoopResultBuilder]: For program point L152-2(lines 152 157) no Hoare annotation was computed. [2022-07-19 17:36:18,083 INFO L895 garLoopResultBuilder]: At program point update_channelsENTRY(lines 208 250) the Hoare annotation is: (let ((.cse20 (= |old(~d1_val~0)| ~d1_val~0)) (.cse21 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse22 (= ~b0_req_up~0 |old(~b0_req_up~0)|)) (.cse23 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse24 (= ~b1_val~0 |old(~b1_val~0)|)) (.cse25 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse26 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse27 (= ~z_val~0 0)) (.cse28 (= |old(~z_ev~0)| ~z_ev~0)) (.cse29 (= |old(~d0_val~0)| ~d0_val~0)) (.cse30 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse31 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse32 (= |old(~b0_val~0)| ~b0_val~0)) (.cse33 (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (let ((.cse11 (not (<= |old(~d0_ev~0)| 0))) (.cse3 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (= |old(~b1_req_up~0)| ~b1_req_up~0) .cse30 .cse31 .cse32 .cse33)) (.cse5 (not (<= |old(~d1_ev~0)| 0))) (.cse8 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse18 (not (<= |old(~b1_ev~0)| 0))) (.cse10 (not (<= 1 ~b0_val_t~0))) (.cse12 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse13 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse14 (not (<= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse1 (not (<= ~comp_m1_i~0 0))) (.cse2 (not (<= 1 ~d1_val_t~0))) (.cse4 (not (<= 1 ~d0_val_t~0))) (.cse17 (not (<= 2 |old(~d1_ev~0)|))) (.cse6 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse7 (not (= |old(~z_val~0)| 0))) (.cse9 (not (<= 2 |old(~b1_ev~0)|))) (.cse19 (not (<= 2 |old(~d0_ev~0)|))) (.cse15 (not (<= 2 |old(~b0_ev~0)|))) (.cse16 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse18 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (or (not (= ~comp_m1_st~0 0)) .cse0 .cse1 .cse2 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (= 1 ~b1_req_up~0) .cse32 .cse33) .cse4 .cse17 .cse6 (not (= |old(~d0_req_up~0)| 1)) .cse7 .cse9 .cse19 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (not (= |old(~b1_req_up~0)| 1)) .cse15 .cse16)))) [2022-07-19 17:36:18,084 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 208 250) no Hoare annotation was computed. [2022-07-19 17:36:18,084 INFO L895 garLoopResultBuilder]: At program point L190(lines 178 192) the Hoare annotation is: (let ((.cse52 (<= 1 ~b1_val_t~0)) (.cse47 (<= ~b1_ev~0 0)) (.cse42 (<= ~d1_ev~0 0)) (.cse58 (<= 1 ~b0_val_t~0)) (.cse50 (<= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse61 (<= 2 ~d0_ev~0)) (.cse51 (<= |old(~d0_ev~0)| ~d0_ev~0)) (.cse45 (= ~b0_ev~0 0)) (.cse53 (<= ~comp_m1_i~0 0)) (.cse54 (= ~z_val~0 ~z_val_t~0)) (.cse55 (<= 2 ~z_ev~0)) (.cse62 (<= 2 ~b1_ev~0)) (.cse41 (<= ~d0_ev~0 0)) (.cse56 (= |old(~z_val~0)| ~z_val~0)) (.cse32 (<= ~d0_val_t~0 ~d0_val~0)) (.cse43 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse57 (<= 1 ~d0_val_t~0)) (.cse33 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse44 (<= |old(~b1_ev~0)| ~b1_ev~0)) (.cse59 (<= 2 ~d1_ev~0)) (.cse34 (<= ~b1_val_t~0 ~b1_val~0)) (.cse35 (<= ~b0_val_t~0 ~b0_val~0)) (.cse36 (= ~z_val~0 0)) (.cse48 (<= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse37 (<= ~d1_val_t~0 ~d1_val~0)) (.cse38 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse60 (<= 1 ~d1_val_t~0)) (.cse49 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse46 (<= ~b1_ev~0 |old(~b1_ev~0)|))) (let ((.cse21 (and .cse53 .cse54 .cse55 .cse62 .cse41 .cse56 .cse32 .cse43 .cse57 .cse33 .cse44 .cse59 .cse34 .cse35 .cse36 .cse48 .cse37 .cse38 .cse60 .cse49 .cse46)) (.cse22 (and .cse53 .cse55 .cse62 .cse41 .cse32 .cse43 .cse44 .cse59 .cse34 .cse35 .cse36 .cse48 .cse37 .cse38 .cse60 .cse49 .cse45 .cse46)) (.cse26 (and .cse53 .cse54 .cse55 .cse62 .cse56 .cse32 .cse42 .cse43 .cse57 .cse33 .cse58 .cse44 .cse50 .cse34 .cse61 .cse35 .cse51 .cse36 .cse37 .cse38 .cse60 .cse46)) (.cse28 (and .cse53 .cse54 .cse55 .cse62 .cse32 .cse42 .cse43 .cse57 .cse44 .cse50 .cse34 .cse61 .cse35 .cse51 .cse36 .cse37 .cse38 .cse60 .cse45 .cse46)) (.cse18 (and .cse53 .cse54 .cse55 .cse62 .cse41 .cse56 .cse32 .cse42 .cse43 .cse57 .cse33 .cse44 .cse34 .cse35 .cse36 .cse37 .cse38 .cse60 .cse46)) (.cse20 (and .cse53 .cse54 .cse55 .cse62 .cse41 .cse56 .cse32 .cse42 .cse43 .cse57 .cse44 .cse34 .cse35 .cse36 .cse37 .cse38 .cse60 .cse45 .cse46)) (.cse5 (not (<= |old(~d1_ev~0)| 0))) (.cse19 (not (<= 2 |old(~b1_ev~0)|))) (.cse40 (and .cse32 .cse43 .cse44 .cse50 .cse34 .cse35 .cse51 .cse36 .cse48 .cse37 .cse38 .cse49 .cse45 .cse46)) (.cse12 (not (<= |old(~d0_ev~0)| 0))) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse1 (and .cse53 .cse54 .cse55 .cse47 .cse41 .cse56 .cse32 .cse42 .cse43 .cse57 .cse58 .cse34 .cse35 .cse36 .cse37 .cse38 .cse60 .cse45)) (.cse2 (not .cse53)) (.cse3 (not .cse60)) (.cse4 (not .cse57)) (.cse23 (not (<= 2 |old(~d1_ev~0)|))) (.cse6 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse31 (and .cse53 .cse54 .cse55 .cse47 .cse56 .cse32 .cse43 .cse57 .cse33 .cse59 .cse50 .cse34 .cse35 .cse51 .cse36 .cse48 .cse37 .cse38 .cse60 .cse49)) (.cse27 (and .cse53 .cse54 .cse55 .cse47 .cse56 .cse32 .cse42 .cse43 .cse57 .cse58 .cse50 .cse34 .cse61 .cse35 .cse51 .cse36 .cse37 .cse38 .cse60 .cse45)) (.cse7 (not (= |old(~z_val~0)| 0))) (.cse8 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse29 (and .cse53 .cse54 .cse55 .cse47 .cse56 .cse32 .cse42 .cse43 .cse57 .cse33 .cse58 .cse50 .cse34 .cse61 .cse35 .cse51 .cse36 .cse37 (<= 2 ~b0_ev~0) .cse38 .cse60)) (.cse9 (not (<= |old(~b1_ev~0)| 0))) (.cse39 (and .cse53 .cse54 .cse55 .cse47 .cse32 .cse43 .cse57 .cse59 .cse50 .cse34 .cse35 .cse51 .cse36 .cse48 .cse37 .cse38 .cse60 .cse49 .cse45)) (.cse10 (and .cse53 .cse55 .cse47 .cse41 .cse32 .cse42 .cse43 .cse57 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse60)) (.cse30 (not (<= 2 |old(~d0_ev~0)|))) (.cse11 (not .cse58)) (.cse24 (and .cse53 .cse54 .cse55 .cse47 .cse41 .cse56 .cse32 .cse43 .cse57 .cse33 .cse58 .cse59 .cse34 .cse35 .cse36 .cse48 .cse37 .cse38 .cse60 .cse49)) (.cse13 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse14 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse15 (not (<= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse25 (and .cse53 .cse54 .cse55 .cse47 .cse41 .cse56 .cse32 .cse43 .cse57 .cse58 .cse59 .cse34 .cse35 .cse52 .cse36 .cse48 .cse37 .cse38 .cse60 .cse49 .cse45)) (.cse16 (not (<= 2 |old(~b0_ev~0)|))) (.cse17 (not .cse52))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse19 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse21 .cse2 .cse22 .cse3 .cse4 .cse23 .cse6 .cse7 .cse8 .cse18 .cse19 .cse10 .cse11 .cse20 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse28 .cse18 .cse29 .cse19 .cse10 .cse30 .cse11 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse21 .cse2 .cse22 .cse26 .cse3 .cse4 .cse23 .cse6 .cse31 .cse27 (and (= ~d1_ev~0 |old(~d1_ev~0)|) .cse32 .cse33 .cse34 .cse35 (= |old(~d0_ev~0)| ~d0_ev~0) .cse36 (= |old(~z_ev~0)| ~z_ev~0) .cse37 .cse38 (= |old(~b1_ev~0)| ~b1_ev~0)) .cse7 .cse8 .cse28 .cse18 .cse29 .cse19 .cse39 .cse10 .cse30 .cse11 .cse20 .cse24 .cse13 .cse14 .cse15 .cse25 .cse40 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse29 .cse9 .cse10 .cse30 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17) (or (not (= ~comp_m1_st~0 0)) .cse0 (and .cse41 .cse32 .cse42 .cse43 .cse44 .cse34 .cse35 .cse36 .cse37 .cse38 .cse45 .cse46) .cse2 .cse3 .cse4 (and .cse47 .cse41 .cse32 .cse42 .cse43 .cse34 .cse35 .cse36 .cse37 .cse38 .cse45) .cse23 .cse6 (not (= |old(~d0_req_up~0)| 1)) .cse7 (and .cse41 .cse32 .cse43 .cse44 .cse34 .cse35 .cse36 .cse48 .cse37 .cse38 .cse49 .cse45 .cse46) (and .cse47 .cse32 .cse43 .cse50 .cse34 .cse35 .cse51 .cse36 .cse48 .cse37 .cse38 .cse49 .cse45) .cse19 (and .cse47 .cse41 .cse32 .cse43 .cse34 .cse35 .cse36 .cse48 .cse37 .cse38 .cse49 .cse45) .cse30 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (not (= |old(~b1_req_up~0)| 1)) (and .cse32 .cse42 .cse43 .cse44 .cse50 .cse34 .cse35 .cse51 .cse36 .cse37 .cse38 .cse45 .cse46) .cse40 .cse16 .cse17 (and .cse47 .cse32 .cse42 .cse43 .cse50 .cse34 .cse35 .cse51 .cse36 .cse37 .cse38 .cse45)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse6 .cse31 .cse27 .cse7 .cse8 .cse29 .cse9 .cse39 .cse10 .cse30 .cse11 .cse24 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17)))) [2022-07-19 17:36:18,084 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 211 249) no Hoare annotation was computed. [2022-07-19 17:36:18,084 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 187) no Hoare annotation was computed. [2022-07-19 17:36:18,084 INFO L899 garLoopResultBuilder]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2022-07-19 17:36:18,085 INFO L895 garLoopResultBuilder]: At program point L145(lines 133 147) the Hoare annotation is: (let ((.cse21 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse22 (<= |old(~b1_ev~0)| ~b1_ev~0)) (.cse23 (<= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse26 (<= |old(~d0_ev~0)| ~d0_ev~0)) (.cse28 (<= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse30 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse31 (= ~b0_ev~0 0)) (.cse33 (<= ~b1_ev~0 |old(~b1_ev~0)|)) (.cse34 (<= ~d0_val_t~0 ~d0_val~0)) (.cse35 (<= ~b1_val_t~0 ~b1_val~0)) (.cse24 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse25 (<= ~b0_val_t~0 ~b0_val~0)) (.cse27 (= ~z_val~0 0)) (.cse36 (<= ~d1_val_t~0 ~d1_val~0)) (.cse37 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse29 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse32 (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (let ((.cse18 (not (<= |old(~d1_ev~0)| 0))) (.cse7 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse8 (and (= ~d1_ev~0 |old(~d1_ev~0)|) .cse34 (= ~b0_ev~0 |old(~b0_ev~0)|) .cse35 .cse24 .cse25 (= |old(~d0_ev~0)| ~d0_ev~0) .cse27 (= |old(~z_ev~0)| ~z_ev~0) .cse36 .cse37 .cse29 (= |old(~b1_ev~0)| ~b1_ev~0) .cse32)) (.cse20 (not (<= |old(~b1_ev~0)| 0))) (.cse10 (not (<= 1 ~b0_val_t~0))) (.cse11 (not (<= |old(~d0_ev~0)| 0))) (.cse12 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse13 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse14 (not (<= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse15 (and .cse34 .cse21 .cse22 .cse23 .cse35 .cse24 .cse25 .cse26 .cse27 .cse28 .cse36 .cse37 .cse29 .cse30 .cse31 .cse32 .cse33)) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse1 (not (<= ~comp_m1_i~0 0))) (.cse2 (not (<= 1 ~d1_val_t~0))) (.cse3 (not (<= 1 ~d0_val_t~0))) (.cse4 (not (<= 2 |old(~d1_ev~0)|))) (.cse5 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse6 (not (= |old(~z_val~0)| 0))) (.cse9 (not (<= 2 |old(~b1_ev~0)|))) (.cse19 (not (<= 2 |old(~d0_ev~0)|))) (.cse16 (not (<= 2 |old(~b0_ev~0)|))) (.cse17 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse20 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or (not (= ~comp_m1_st~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~d0_req_up~0)| 1)) .cse6 .cse9 .cse19 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (not (= |old(~b1_req_up~0)| 1)) (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (= 1 ~b1_req_up~0) .cse32 .cse33) .cse16 .cse17)))) [2022-07-19 17:36:18,085 INFO L899 garLoopResultBuilder]: For program point L240-1(lines 208 250) no Hoare annotation was computed. [2022-07-19 17:36:18,085 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 142) no Hoare annotation was computed. [2022-07-19 17:36:18,085 INFO L899 garLoopResultBuilder]: For program point L137-2(lines 137 142) no Hoare annotation was computed. [2022-07-19 17:36:18,085 INFO L899 garLoopResultBuilder]: For program point L212-1(lines 211 249) no Hoare annotation was computed. [2022-07-19 17:36:18,086 INFO L895 garLoopResultBuilder]: At program point L175(lines 163 177) the Hoare annotation is: (let ((.cse58 (<= 1 ~b1_val_t~0)) (.cse57 (<= 2 ~d1_ev~0)) (.cse60 (<= 2 ~b1_ev~0)) (.cse24 (<= |old(~b1_ev~0)| ~b1_ev~0)) (.cse33 (<= ~b1_ev~0 |old(~b1_ev~0)|)) (.cse21 (<= ~d0_ev~0 0)) (.cse51 (= ~z_val~0 ~z_val_t~0)) (.cse53 (= |old(~z_val~0)| ~z_val~0)) (.cse61 (<= ~d1_ev~0 0)) (.cse54 (<= 1 ~d0_val_t~0)) (.cse55 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse56 (<= 1 ~b0_val_t~0)) (.cse59 (<= 1 ~d1_val_t~0)) (.cse50 (<= ~comp_m1_i~0 0)) (.cse52 (<= 2 ~z_ev~0)) (.cse34 (<= ~b1_ev~0 0)) (.cse22 (<= ~d0_val_t~0 ~d0_val~0)) (.cse23 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse35 (<= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse25 (<= ~b1_val_t~0 ~b1_val~0)) (.cse62 (<= 2 ~d0_ev~0)) (.cse26 (<= ~b0_val_t~0 ~b0_val~0)) (.cse36 (<= |old(~d0_ev~0)| ~d0_ev~0)) (.cse27 (= ~z_val~0 0)) (.cse28 (<= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse49 (<= ~d1_val_t~0 ~d1_val~0)) (.cse29 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse30 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse31 (= ~b0_ev~0 0)) (.cse32 (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (let ((.cse41 (and .cse50 .cse52 .cse34 .cse22 .cse23 .cse35 .cse25 .cse62 .cse26 .cse36 .cse27 .cse28 .cse49 .cse29 .cse30 .cse31 .cse32)) (.cse8 (not (<= |old(~b1_ev~0)| 0))) (.cse45 (and .cse50 .cse51 .cse52 .cse34 .cse53 .cse22 .cse61 .cse23 .cse54 .cse55 .cse56 .cse35 .cse25 .cse62 .cse26 .cse36 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse32)) (.cse18 (and .cse50 .cse51 .cse52 .cse34 .cse21 .cse53 .cse22 .cse61 .cse23 .cse54 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse31 .cse32)) (.cse19 (and .cse50 .cse51 .cse52 .cse34 .cse21 .cse53 .cse22 .cse61 .cse23 .cse54 .cse55 .cse56 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse32)) (.cse20 (not (<= |old(~d1_ev~0)| 0))) (.cse43 (and .cse50 .cse51 .cse52 .cse60 .cse21 .cse53 .cse22 .cse61 .cse23 .cse54 .cse56 .cse24 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse31 .cse32 .cse33)) (.cse10 (not (<= |old(~d0_ev~0)| 0))) (.cse44 (and .cse50 .cse51 .cse52 .cse60 .cse21 .cse53 .cse22 .cse61 .cse23 .cse54 .cse55 .cse24 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse32 .cse33)) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse39 (and .cse50 .cse52 .cse34 .cse22 .cse23 .cse57 .cse35 .cse25 .cse26 .cse36 .cse27 .cse28 .cse49 .cse29 .cse30 .cse31 .cse32)) (.cse1 (not .cse50)) (.cse2 (not .cse59)) (.cse3 (not .cse54)) (.cse4 (not (<= 2 |old(~d1_ev~0)|))) (.cse5 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse6 (not (= |old(~z_val~0)| 0))) (.cse7 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse37 (not (<= 2 |old(~b1_ev~0)|))) (.cse47 (and .cse50 .cse51 .cse52 .cse60 .cse21 .cse53 .cse22 .cse23 .cse54 .cse24 .cse57 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse31 .cse32 .cse33)) (.cse40 (and .cse50 .cse51 .cse52 .cse34 .cse53 .cse22 .cse23 .cse54 .cse55 .cse57 .cse35 .cse25 .cse26 .cse36 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse32)) (.cse38 (not (<= 2 |old(~d0_ev~0)|))) (.cse48 (and .cse50 .cse51 .cse52 .cse60 .cse21 .cse53 .cse22 .cse23 .cse54 .cse55 .cse24 .cse57 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse32 .cse33)) (.cse9 (not .cse56)) (.cse42 (and (= ~d1_ev~0 |old(~d1_ev~0)|) .cse22 .cse55 .cse25 .cse26 (= |old(~d0_ev~0)| ~d0_ev~0) .cse27 (= |old(~z_ev~0)| ~z_ev~0) .cse49 .cse29 (= |old(~b1_ev~0)| ~b1_ev~0) .cse32)) (.cse11 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse12 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse13 (not (<= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse14 (not (<= 2 |old(~b0_ev~0)|))) (.cse15 (and .cse50 .cse51 .cse52 .cse34 .cse21 .cse53 .cse22 .cse23 .cse54 .cse57 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse31 .cse32)) (.cse16 (not .cse58)) (.cse17 (and .cse50 .cse51 .cse52 .cse34 .cse21 .cse53 .cse22 .cse23 .cse54 .cse55 .cse56 .cse57 .cse25 .cse26 .cse58 .cse27 .cse28 .cse49 (<= 2 ~b0_ev~0) .cse29 .cse59 .cse30 .cse32)) (.cse46 (and .cse22 .cse23 .cse24 .cse35 .cse25 .cse26 .cse36 .cse27 .cse28 .cse49 .cse29 .cse30 .cse31 .cse32 .cse33))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or (not (= ~comp_m1_st~0 0)) (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) .cse0 .cse1 (and .cse34 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse2 (and .cse34 .cse22 .cse23 .cse35 .cse25 .cse26 .cse36 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse3 .cse4 .cse5 (not (= |old(~d0_req_up~0)| 1)) .cse6 (and .cse22 .cse23 .cse24 .cse35 .cse25 .cse26 .cse36 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) .cse37 .cse38 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (not (= |old(~b1_req_up~0)| 1)) .cse14 .cse16) (or .cse0 .cse39 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse40 .cse38 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse41 .cse37 .cse38 .cse9 .cse42 .cse43 .cse11 .cse12 .cse44 .cse45 .cse13 .cse14 .cse16 .cse46) (or .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse41 .cse8 .cse38 .cse9 .cse11 .cse12 .cse45 .cse13 .cse14 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse37 .cse47 .cse48 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse37 .cse9 .cse43 .cse10 .cse11 .cse12 .cse44 .cse13 .cse14 .cse16) (or .cse0 .cse39 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse37 .cse47 .cse40 .cse38 .cse48 .cse9 .cse42 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse46)))) [2022-07-19 17:36:18,086 INFO L899 garLoopResultBuilder]: For program point L233-1(lines 211 249) no Hoare annotation was computed. [2022-07-19 17:36:18,086 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2022-07-19 17:36:18,086 INFO L899 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2022-07-19 17:36:18,086 INFO L899 garLoopResultBuilder]: For program point L374-1(lines 350 382) no Hoare annotation was computed. [2022-07-19 17:36:18,086 INFO L895 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 350 382) the Hoare annotation is: (let ((.cse17 (not (= ~comp_m1_st~0 0))) (.cse4 (not (<= |old(~d1_ev~0)| 0))) (.cse13 (not (<= |old(~d0_ev~0)| 0))) (.cse18 (not (<= |old(~b1_ev~0)| 0))) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse1 (not (<= ~comp_m1_i~0 0))) (.cse2 (not (<= 1 ~d1_val_t~0))) (.cse3 (not (<= 1 ~d0_val_t~0))) (.cse20 (not (<= 2 |old(~d1_ev~0)|))) (.cse5 (not (= ~z_val~0 ~z_val_t~0))) (.cse6 (and (= ~d1_ev~0 |old(~d1_ev~0)|) (= ~b0_ev~0 |old(~b0_ev~0)|) (= |old(~d0_ev~0)| ~d0_ev~0) (= |old(~z_ev~0)| ~z_ev~0) (= |old(~b1_ev~0)| ~b1_ev~0))) (.cse7 (not (= ~z_val~0 0))) (.cse8 (not (<= 2 |old(~b1_ev~0)|))) (.cse19 (not (<= 2 |old(~d0_ev~0)|))) (.cse9 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse10 (not (<= ~d0_val_t~0 ~d0_val~0))) (.cse11 (not (<= 1 ~b0_val_t~0))) (.cse12 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse14 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse15 (not (<= 2 |old(~b0_ev~0)|))) (.cse16 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 (not (= |old(~b0_ev~0)| 1)) .cse12 .cse14 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse18 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16))) [2022-07-19 17:36:18,087 INFO L899 garLoopResultBuilder]: For program point L364-1(lines 353 381) no Hoare annotation was computed. [2022-07-19 17:36:18,087 INFO L899 garLoopResultBuilder]: For program point L354-1(lines 353 381) no Hoare annotation was computed. [2022-07-19 17:36:18,088 INFO L899 garLoopResultBuilder]: For program point L369-1(lines 353 381) no Hoare annotation was computed. [2022-07-19 17:36:18,088 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 350 382) no Hoare annotation was computed. [2022-07-19 17:36:18,088 INFO L899 garLoopResultBuilder]: For program point L359-1(lines 353 381) no Hoare annotation was computed. [2022-07-19 17:36:18,088 INFO L895 garLoopResultBuilder]: At program point L415(lines 399 417) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-07-19 17:36:18,089 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-07-19 17:36:18,089 INFO L899 garLoopResultBuilder]: For program point L440-1(line 440) no Hoare annotation was computed. [2022-07-19 17:36:18,089 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2022-07-19 17:36:18,089 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2022-07-19 17:36:18,089 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 51 101) no Hoare annotation was computed. [2022-07-19 17:36:18,089 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-07-19 17:36:18,089 INFO L895 garLoopResultBuilder]: At program point L432-1(lines 429 454) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-07-19 17:36:18,089 INFO L895 garLoopResultBuilder]: At program point L490(lines 461 492) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (= ~z_val~0 ~z_val_t~0) (<= 2 ~z_ev~0) (= ~b0_req_up~0 1) (= ~comp_m1_st~0 0) (<= 2 ~b1_ev~0) (<= 1 ~d0_val_t~0) (= ~b0_val_t~0 1) (<= 2 ~d1_ev~0) (= ~d0_req_up~0 1) (= ~b0_val~0 0) (<= 2 ~d0_ev~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= 2 ~b0_ev~0) (= ~d1_req_up~0 1) (<= 1 ~d1_val_t~0) (= 1 ~b1_req_up~0)) [2022-07-19 17:36:18,089 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2022-07-19 17:36:18,090 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 17:36:18,090 INFO L899 garLoopResultBuilder]: For program point L61(lines 51 101) no Hoare annotation was computed. [2022-07-19 17:36:18,090 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 17:36:18,090 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2022-07-19 17:36:18,090 INFO L895 garLoopResultBuilder]: At program point L20(lines 15 22) the Hoare annotation is: false [2022-07-19 17:36:18,090 INFO L899 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2022-07-19 17:36:18,090 INFO L895 garLoopResultBuilder]: At program point L425(line 425) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (= ~z_val~0 ~z_val_t~0) (<= 2 ~z_ev~0) (= ~b0_req_up~0 1) (= ~comp_m1_st~0 0) (<= 2 ~b1_ev~0) (<= 1 ~d0_val_t~0) (= ~b0_val_t~0 1) (<= 2 ~d1_ev~0) (= ~d0_req_up~0 1) (= ~b0_val~0 0) (<= 2 ~d0_ev~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= 2 ~b0_ev~0) (= ~d1_req_up~0 1) (<= 1 ~d1_val_t~0) (= 1 ~b1_req_up~0)) [2022-07-19 17:36:18,090 INFO L899 garLoopResultBuilder]: For program point L425-1(line 425) no Hoare annotation was computed. [2022-07-19 17:36:18,090 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2022-07-19 17:36:18,091 INFO L899 garLoopResultBuilder]: For program point L79(lines 51 101) no Hoare annotation was computed. [2022-07-19 17:36:18,098 INFO L895 garLoopResultBuilder]: At program point L286(line 286) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-07-19 17:36:18,098 INFO L902 garLoopResultBuilder]: At program point L509(lines 493 511) the Hoare annotation is: true [2022-07-19 17:36:18,102 INFO L895 garLoopResultBuilder]: At program point L311(lines 279 316) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-07-19 17:36:18,102 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 507) no Hoare annotation was computed. [2022-07-19 17:36:18,102 INFO L899 garLoopResultBuilder]: For program point L501-2(lines 501 507) no Hoare annotation was computed. [2022-07-19 17:36:18,102 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 84) no Hoare annotation was computed. [2022-07-19 17:36:18,102 INFO L895 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse16 (<= 2 ~d1_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse18 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse17 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-07-19 17:36:18,102 INFO L895 garLoopResultBuilder]: At program point L427-1(line 427) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (= ~z_val~0 ~z_val_t~0) (<= 2 ~z_ev~0) (= ~b0_ev~0 1) (<= ~d0_val_t~0 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= 1 ~b0_val_t~0) (<= ~b1_val_t~0 ~b1_val~0) (<= ~b0_val_t~0 ~b0_val~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= ~d1_val_t~0 ~d1_val~0) (<= 1 ~d1_val_t~0)) [2022-07-19 17:36:18,103 INFO L895 garLoopResultBuilder]: At program point L295(lines 285 310) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-07-19 17:36:18,103 INFO L895 garLoopResultBuilder]: At program point L444(line 444) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse18 (<= ~d0_ev~0 0)) (.cse16 (<= 2 ~d1_ev~0)) (.cse17 (<= 2 ~b0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse19 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse19 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse19 .cse18 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse19 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse19 .cse18 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-07-19 17:36:18,103 INFO L895 garLoopResultBuilder]: At program point L444-1(line 444) the Hoare annotation is: (let ((.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse3 (<= ~d0_val_t~0 ~d0_val~0)) (.cse4 (<= 1 ~d0_val_t~0)) (.cse5 (<= 1 ~b0_val_t~0)) (.cse6 (<= ~b1_val_t~0 ~b1_val~0)) (.cse7 (<= ~b0_val_t~0 ~b0_val~0)) (.cse8 (<= 1 ~b1_val_t~0)) (.cse9 (= ~z_val~0 0)) (.cse10 (<= ~d1_val_t~0 ~d1_val~0)) (.cse11 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 (= ~b0_ev~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 2 ~b0_ev~0) .cse11))) [2022-07-19 17:36:18,103 INFO L895 garLoopResultBuilder]: At program point L428(line 428) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (= ~z_val~0 ~z_val_t~0) (<= 2 ~z_ev~0) (= ~comp_m1_st~0 0) (= ~b0_ev~0 1) (<= ~d0_val_t~0 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= 1 ~b0_val_t~0) (<= ~b1_val_t~0 ~b1_val~0) (<= ~b0_val_t~0 ~b0_val~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= ~d1_val_t~0 ~d1_val~0) (<= 1 ~d1_val_t~0)) [2022-07-19 17:36:18,103 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2022-07-19 17:36:18,103 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 51 101) no Hoare annotation was computed. [2022-07-19 17:36:18,103 INFO L899 garLoopResultBuilder]: For program point L288(line 288) no Hoare annotation was computed. [2022-07-19 17:36:18,103 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 17:36:18,104 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2022-07-19 17:36:18,104 INFO L895 garLoopResultBuilder]: At program point L255-2(lines 251 263) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse16 (<= 2 ~d1_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse18 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse17 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-07-19 17:36:18,104 INFO L895 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: (let ((.cse3 (= ~comp_m1_st~0 0)) (.cse14 (<= 2 ~b1_ev~0)) (.cse16 (<= 2 ~d0_ev~0)) (.cse15 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse17 (<= ~b1_ev~0 0)) (.cse19 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse18 (<= 2 ~d1_ev~0)) (.cse7 (<= ~b1_val_t~0 ~b1_val~0)) (.cse8 (<= ~b0_val_t~0 ~b0_val~0)) (.cse9 (<= 1 ~b1_val_t~0)) (.cse10 (= ~z_val~0 0)) (.cse11 (<= ~d1_val_t~0 ~d1_val~0)) (.cse13 (<= 2 ~b0_ev~0)) (.cse12 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~b0_ev~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse18 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse14 .cse19 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse14 .cse19 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse18 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse17 .cse19 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse17 .cse19 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12))) [2022-07-19 17:36:18,104 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-07-19 17:36:18,104 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 17:36:18,104 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2022-07-19 17:36:18,105 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2022-07-19 17:36:18,105 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 88 96) no Hoare annotation was computed. [2022-07-19 17:36:18,105 INFO L895 garLoopResultBuilder]: At program point L405(line 405) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-07-19 17:36:18,105 INFO L899 garLoopResultBuilder]: For program point L405-1(line 405) no Hoare annotation was computed. [2022-07-19 17:36:18,105 INFO L895 garLoopResultBuilder]: At program point L455(lines 418 460) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (= ~z_val~0 ~z_val_t~0) (<= ~d0_val_t~0 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= 1 ~b0_val_t~0) (<= ~b1_val_t~0 ~b1_val~0) (<= ~b0_val_t~0 ~b0_val~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= 2 ~b0_ev~0)) [2022-07-19 17:36:18,105 INFO L895 garLoopResultBuilder]: At program point L100(lines 46 102) the Hoare annotation is: (let ((.cse6 (<= ~d1_ev~0 0)) (.cse3 (<= ~b1_ev~0 0)) (.cse18 (<= 2 ~d0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse17 (<= 2 ~b1_ev~0)) (.cse4 (<= ~d0_ev~0 0)) (.cse5 (<= ~d0_val_t~0 ~d0_val~0)) (.cse7 (<= 1 ~d0_val_t~0)) (.cse8 (<= 1 ~b0_val_t~0)) (.cse19 (<= 2 ~d1_ev~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (= ~z_req_up~0 1)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse15 (<= 2 ~b0_ev~0)) (.cse16 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse5 .cse7 .cse8 .cse19 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse19 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-07-19 17:36:18,106 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2022-07-19 17:36:18,106 INFO L899 garLoopResultBuilder]: For program point L290-1(lines 285 310) no Hoare annotation was computed. [2022-07-19 17:36:18,106 INFO L895 garLoopResultBuilder]: At program point L414(lines 403 416) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-07-19 17:36:18,106 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 306) no Hoare annotation was computed. [2022-07-19 17:36:18,108 INFO L356 BasicCegarLoop]: Path program histogram: [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] [2022-07-19 17:36:18,111 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 17:36:18,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 05:36:18 BoogieIcfgContainer [2022-07-19 17:36:18,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 17:36:18,217 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 17:36:18,217 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 17:36:18,217 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 17:36:18,218 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:34:47" (3/4) ... [2022-07-19 17:36:18,220 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 17:36:18,223 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-07-19 17:36:18,223 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-07-19 17:36:18,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-07-19 17:36:18,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-07-19 17:36:18,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-07-19 17:36:18,228 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-07-19 17:36:18,228 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-19 17:36:18,229 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 17:36:18,229 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 17:36:18,244 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && ((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_req_up) == 1)) || (((((((((((((\old(z_ev) <= z_ev && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && 1 == b1_req_up) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) [2022-07-19 17:36:18,245 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) && (((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || ((((((((((((b1_ev <= 0 && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(\old(b1_req_up) == 1)) || !(2 <= \old(b0_ev))) || (((((((((((((\old(z_ev) <= z_ev && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || ((((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || ((((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) [2022-07-19 17:36:18,245 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) && ((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((!(comp_m1_st == 0) || ((((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || (((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d1_val_t)) || ((((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || (((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_req_up) == 1)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)))) && ((((((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || ((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev)))) && ((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(2 <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)))) && ((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(2 <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(d0_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || (((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || ((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) [2022-07-19 17:36:18,245 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(b1_ev))) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(b1_ev))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || (((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(\old(b1_ev) <= 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || (((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || ((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || ((((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || (((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_req_up) == 1)) || ((((((((((((d0_val_t <= d0_val && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || (((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0))) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(\old(b1_ev) <= 0)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) [2022-07-19 17:36:18,246 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(1 <= b1_val_t)) && (((((((((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || (((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && d1_ev == \old(d1_ev)) && 2 <= b1_ev) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && \old(b1_ev) == b1_ev)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || (((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(1 <= b0_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || (((((((((((d0_val_t <= d0_val && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || ((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || ((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || (((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0)) || !(\old(b1_req_up) == 1)) || !(2 <= \old(b0_ev))) || (((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t)) [2022-07-19 17:36:18,247 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(b1_ev == 1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) || 1 <= __retres1) && ((((((((((((((!(comp_m1_i <= 0) || !(d1_ev == 1)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) || 1 <= __retres1)) && (((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(z_val == z_val_t)) || !(b0_ev == 1)) || !(2 <= z_ev)) || !(z_val == 0)) || (comp_m1_st == \old(comp_m1_st) && 1 <= __retres1)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((comp_m1_st == \old(comp_m1_st) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && ((((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(d0_ev == 1)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) || 1 <= __retres1) [2022-07-19 17:36:18,247 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(z_val == z_val_t)) || !(b0_ev == 1)) || !(2 <= z_ev)) || ((comp_m1_st == \old(comp_m1_st) && 1 <= \result) && 1 <= __retres1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) && (((((((((((((((1 <= \result && 1 <= __retres1) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(d0_ev == 1)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((comp_m1_st == \old(comp_m1_st) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && ((((((((((((((!(comp_m1_i <= 0) || !(d1_ev == 1)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || ((comp_m1_st == \old(comp_m1_st) && 1 <= \result) && 1 <= __retres1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((((1 <= \result && 1 <= __retres1) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(b1_ev == 1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) [2022-07-19 17:36:18,267 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 17:36:18,268 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 17:36:18,268 INFO L158 Benchmark]: Toolchain (without parser) took 91921.80ms. Allocated memory was 125.8MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 95.9MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 403.1MB. Max. memory is 16.1GB. [2022-07-19 17:36:18,268 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 102.8MB. Free memory was 60.2MB in the beginning and 60.2MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:36:18,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.64ms. Allocated memory is still 125.8MB. Free memory was 95.6MB in the beginning and 97.9MB in the end (delta: -2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 17:36:18,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.28ms. Allocated memory is still 125.8MB. Free memory was 97.9MB in the beginning and 95.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 17:36:18,269 INFO L158 Benchmark]: Boogie Preprocessor took 38.29ms. Allocated memory is still 125.8MB. Free memory was 95.8MB in the beginning and 94.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:36:18,269 INFO L158 Benchmark]: RCFGBuilder took 474.47ms. Allocated memory is still 125.8MB. Free memory was 94.1MB in the beginning and 78.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-19 17:36:18,269 INFO L158 Benchmark]: TraceAbstraction took 91030.10ms. Allocated memory was 125.8MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 77.7MB in the beginning and 3.2GB in the end (delta: -3.2GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2022-07-19 17:36:18,269 INFO L158 Benchmark]: Witness Printer took 50.74ms. Allocated memory is still 3.7GB. Free memory was 3.2GB in the beginning and 3.2GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-19 17:36:18,270 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 102.8MB. Free memory was 60.2MB in the beginning and 60.2MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.64ms. Allocated memory is still 125.8MB. Free memory was 95.6MB in the beginning and 97.9MB in the end (delta: -2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.28ms. Allocated memory is still 125.8MB. Free memory was 97.9MB in the beginning and 95.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.29ms. Allocated memory is still 125.8MB. Free memory was 95.8MB in the beginning and 94.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 474.47ms. Allocated memory is still 125.8MB. Free memory was 94.1MB in the beginning and 78.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 91030.10ms. Allocated memory was 125.8MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 77.7MB in the beginning and 3.2GB in the end (delta: -3.2GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 50.74ms. Allocated memory is still 3.7GB. Free memory was 3.2GB in the beginning and 3.2GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 90.9s, OverallIterations: 34, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.4s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 54.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6126 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6051 mSDsluCounter, 14443 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8707 mSDsCounter, 840 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4486 IncrementalHoareTripleChecker+Invalid, 5326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 840 mSolverCounterUnsat, 5736 mSDtfsCounter, 4486 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4597 GetRequests, 4228 SyntacticMatches, 4 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11183occurred in iteration=33, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 14460 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 22312 PreInvPairs, 23589 NumberOfFragments, 24499 HoareAnnotationTreeSize, 22312 FomulaSimplifications, 111471 FormulaSimplificationTreeSizeReduction, 10.2s HoareSimplificationTime, 34 FomulaSimplificationsInter, 864480 FormulaSimplificationTreeSizeReductionInter, 43.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 7376 NumberOfCodeBlocks, 7320 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 7448 ConstructedInterpolants, 0 QuantifiedInterpolants, 16593 SizeOfPredicates, 12 NumberOfNonLiveVariables, 15898 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 66 InterpolantComputations, 33 PerfectInterpolantSequences, 2243/2459 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b0_req_up == 1) && comp_m1_st == 0) && 2 <= b1_ev) && 1 <= d0_val_t) && b0_val_t == 1) && 2 <= d1_ev) && d0_req_up == 1) && b0_val == 0) && 2 <= d0_ev) && 1 <= b1_val_t) && z_val == 0) && 2 <= b0_ev) && d1_req_up == 1) && 1 <= d1_val_t) && 1 == b1_req_up - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(1 <= b1_val_t)) && (((((((((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || (((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && d1_ev == \old(d1_ev)) && 2 <= b1_ev) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && \old(b1_ev) == b1_ev)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || (((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(1 <= b0_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || (((((((((((d0_val_t <= d0_val && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || ((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || ((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || (((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0)) || !(\old(b1_req_up) == 1)) || !(2 <= \old(b0_ev))) || (((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t)) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(b1_ev))) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(b1_ev))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || (((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(\old(b1_ev) <= 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || (((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || ((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || ((((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || (((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_req_up) == 1)) || ((((((((((((d0_val_t <= d0_val && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || (((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0))) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(\old(b1_ev) <= 0)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((((((comp_m1_i <= 0 && z_val == z_val_t) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && 2 <= b0_ev - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (((((((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(b1_ev == 1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) || 1 <= __retres1) && ((((((((((((((!(comp_m1_i <= 0) || !(d1_ev == 1)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) || 1 <= __retres1)) && (((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(z_val == z_val_t)) || !(b0_ev == 1)) || !(2 <= z_ev)) || !(z_val == 0)) || (comp_m1_st == \old(comp_m1_st) && 1 <= __retres1)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((comp_m1_st == \old(comp_m1_st) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && ((((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(d0_ev == 1)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) || 1 <= __retres1) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(d1_ev <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(b1_ev <= 0)) || !(2 <= d0_ev)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(2 <= d1_ev)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(2 <= b1_ev)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(b0_val_t <= b0_val)) || !(d0_ev <= 0)) || !(1 <= b1_val_t))) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(2 <= d1_ev)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(2 <= b1_ev)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(2 <= d0_ev)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(d1_ev <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(2 <= b1_ev)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(2 <= d0_ev)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(d1_ev <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(b1_ev <= 0)) || !(b0_val_t <= b0_val)) || !(d0_ev <= 0)) || !(1 <= b1_val_t))) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(2 <= d1_ev)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(b1_ev <= 0)) || !(b0_val_t <= b0_val)) || !(d0_ev <= 0)) || !(1 <= b1_val_t))) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(d1_ev <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(2 <= b1_ev)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(b0_val_t <= b0_val)) || !(d0_ev <= 0)) || !(1 <= b1_val_t))) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(2 <= d1_ev)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(b1_ev <= 0)) || !(2 <= d0_ev)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) - InvariantResult [Line: 429]: Loop Invariant Derived loop invariant: (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(z_val == z_val_t)) || !(b0_ev == 1)) || !(2 <= z_ev)) || ((comp_m1_st == \old(comp_m1_st) && 1 <= \result) && 1 <= __retres1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) && (((((((((((((((1 <= \result && 1 <= __retres1) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(d0_ev == 1)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((comp_m1_st == \old(comp_m1_st) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && ((((((((((((((!(comp_m1_i <= 0) || !(d1_ev == 1)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || ((comp_m1_st == \old(comp_m1_st) && 1 <= \result) && 1 <= __retres1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((((1 <= \result && 1 <= __retres1) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(b1_ev == 1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) && ((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((!(comp_m1_st == 0) || ((((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || (((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d1_val_t)) || ((((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || (((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_req_up) == 1)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)))) && ((((((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || ((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev)))) && ((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(2 <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)))) && ((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(2 <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(d0_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || (((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || ((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) && (((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || ((((((((((((b1_ev <= 0 && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(\old(b1_req_up) == 1)) || !(2 <= \old(b0_ev))) || (((((((((((((\old(z_ev) <= z_ev && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || ((((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || ((((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && ((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_req_up) == 1)) || (((((((((((((\old(z_ev) <= z_ev && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && 1 == b1_req_up) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) RESULT: Ultimate proved your program to be correct! [2022-07-19 17:36:18,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE