./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 e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP --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.3-dev-e7bb482 [2023-11-06 22:01:10,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:01:10,996 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:01:11,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:01:11,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:01:11,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:01:11,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:01:11,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:01:11,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:01:11,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:01:11,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:01:11,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:01:11,060 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:01:11,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:01:11,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:01:11,063 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:01:11,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:01:11,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:01:11,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:01:11,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:01:11,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:01:11,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:01:11,067 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:01:11,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:01:11,068 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:01:11,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:01:11,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:01:11,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:01:11,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:01:11,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:01:11,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:01:11,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:01:11,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:01:11,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:01:11,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:01:11,075 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:01:11,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:01:11,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:01:11,076 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:01:11,076 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP 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 [2023-11-06 22:01:11,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:01:11,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:01:11,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:01:11,514 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:01:11,514 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:01:11,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/systemc/bist_cell.cil.c [2023-11-06 22:01:14,771 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:01:15,171 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:01:15,173 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/sv-benchmarks/c/systemc/bist_cell.cil.c [2023-11-06 22:01:15,191 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/data/7b33f0035/ff4e9da14ad24e4ca3283d0849bbb1ca/FLAG90052a238 [2023-11-06 22:01:15,212 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/data/7b33f0035/ff4e9da14ad24e4ca3283d0849bbb1ca [2023-11-06 22:01:15,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:01:15,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:01:15,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:01:15,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:01:15,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:01:15,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:01:15" (1/1) ... [2023-11-06 22:01:15,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68641b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:15, skipping insertion in model container [2023-11-06 22:01:15,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:01:15" (1/1) ... [2023-11-06 22:01:15,301 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:01:15,479 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2023-11-06 22:01:15,538 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:01:15,550 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:01:15,564 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2023-11-06 22:01:15,593 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:01:15,613 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:01:15,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:15 WrapperNode [2023-11-06 22:01:15,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:01:15,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:01:15,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:01:15,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:01:15,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:15" (1/1) ... [2023-11-06 22:01:15,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:15" (1/1) ... [2023-11-06 22:01:15,678 INFO L138 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 229 [2023-11-06 22:01:15,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:01:15,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:01:15,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:01:15,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:01:15,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:15" (1/1) ... [2023-11-06 22:01:15,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:15" (1/1) ... [2023-11-06 22:01:15,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:15" (1/1) ... [2023-11-06 22:01:15,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:15" (1/1) ... [2023-11-06 22:01:15,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:15" (1/1) ... [2023-11-06 22:01:15,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:15" (1/1) ... [2023-11-06 22:01:15,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:15" (1/1) ... [2023-11-06 22:01:15,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:15" (1/1) ... [2023-11-06 22:01:15,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:01:15,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:01:15,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:01:15,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:01:15,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:15" (1/1) ... [2023-11-06 22:01:15,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:01:15,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:15,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:01:15,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:01:15,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:01:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-06 22:01:15,811 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-06 22:01:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-06 22:01:15,811 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-06 22:01:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-06 22:01:15,812 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-06 22:01:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-06 22:01:15,812 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-06 22:01:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:01:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-06 22:01:15,812 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-06 22:01:15,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:01:15,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:01:15,910 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:01:15,913 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:01:16,358 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:01:16,367 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:01:16,367 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:01:16,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:01:16 BoogieIcfgContainer [2023-11-06 22:01:16,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:01:16,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:01:16,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:01:16,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:01:16,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:01:15" (1/3) ... [2023-11-06 22:01:16,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ed215d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:01:16, skipping insertion in model container [2023-11-06 22:01:16,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:15" (2/3) ... [2023-11-06 22:01:16,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ed215d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:01:16, skipping insertion in model container [2023-11-06 22:01:16,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:01:16" (3/3) ... [2023-11-06 22:01:16,389 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2023-11-06 22:01:16,414 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:01:16,415 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:01:16,510 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:01:16,519 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2a10d93f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:01:16,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:01:16,526 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) [2023-11-06 22:01:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 22:01:16,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:16,541 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] [2023-11-06 22:01:16,542 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:16,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:16,551 INFO L85 PathProgramCache]: Analyzing trace with hash 129401130, now seen corresponding path program 1 times [2023-11-06 22:01:16,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:16,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726479514] [2023-11-06 22:01:16,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:16,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:17,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:17,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:01:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:17,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:01:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:17,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-06 22:01:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:17,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:01:17,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:17,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726479514] [2023-11-06 22:01:17,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726479514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:17,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:01:17,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:01:17,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931986895] [2023-11-06 22:01:17,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:17,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:01:17,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:17,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:01:17,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:01:17,329 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) [2023-11-06 22:01:18,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:18,442 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2023-11-06 22:01:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:01:18,445 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 [2023-11-06 22:01:18,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:18,458 INFO L225 Difference]: With dead ends: 281 [2023-11-06 22:01:18,459 INFO L226 Difference]: Without dead ends: 178 [2023-11-06 22:01:18,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:01:18,468 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 211 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:18,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 304 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:01:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-06 22:01:18,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 117. [2023-11-06 22:01:18,543 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) [2023-11-06 22:01:18,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2023-11-06 22:01:18,548 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 42 [2023-11-06 22:01:18,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:18,548 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2023-11-06 22:01:18,549 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) [2023-11-06 22:01:18,549 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2023-11-06 22:01:18,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 22:01:18,555 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:18,556 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] [2023-11-06 22:01:18,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:01:18,557 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:18,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:18,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1179475252, now seen corresponding path program 1 times [2023-11-06 22:01:18,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:18,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261132938] [2023-11-06 22:01:18,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:18,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:18,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:18,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:01:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:18,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:01:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:18,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:01:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:01:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:01:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:01:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 22:01:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:01:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:01:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:01:19,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:19,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261132938] [2023-11-06 22:01:19,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261132938] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:19,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735989288] [2023-11-06 22:01:19,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:19,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:19,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:19,068 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:19,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:01:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:01:19,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 22:01:19,311 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:19,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735989288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:19,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:19,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-06 22:01:19,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304310713] [2023-11-06 22:01:19,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:19,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:01:19,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:19,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:01:19,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:01:19,317 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) [2023-11-06 22:01:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:19,350 INFO L93 Difference]: Finished difference Result 227 states and 333 transitions. [2023-11-06 22:01:19,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:01:19,350 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 [2023-11-06 22:01:19,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:19,353 INFO L225 Difference]: With dead ends: 227 [2023-11-06 22:01:19,353 INFO L226 Difference]: Without dead ends: 117 [2023-11-06 22:01:19,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:01:19,357 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 [2023-11-06 22:01:19,357 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] [2023-11-06 22:01:19,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-06 22:01:19,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-11-06 22:01:19,384 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) [2023-11-06 22:01:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2023-11-06 22:01:19,387 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 101 [2023-11-06 22:01:19,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:19,388 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2023-11-06 22:01:19,388 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) [2023-11-06 22:01:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2023-11-06 22:01:19,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 22:01:19,393 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:19,393 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] [2023-11-06 22:01:19,402 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:19,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:19,600 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:19,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash -779099534, now seen corresponding path program 1 times [2023-11-06 22:01:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:19,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043063721] [2023-11-06 22:01:19,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:19,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:01:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:01:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:01:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:01:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:01:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:01:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 22:01:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:01:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:01:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:01:19,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:19,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043063721] [2023-11-06 22:01:19,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043063721] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:19,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722708467] [2023-11-06 22:01:19,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:19,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:19,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:19,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:19,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:01:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:20,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:01:20,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 22:01:20,225 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:20,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722708467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:20,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:20,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-06 22:01:20,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452421086] [2023-11-06 22:01:20,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:20,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:01:20,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:20,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:01:20,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:01:20,229 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) [2023-11-06 22:01:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:20,498 INFO L93 Difference]: Finished difference Result 356 states and 529 transitions. [2023-11-06 22:01:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:01:20,499 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 [2023-11-06 22:01:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:20,502 INFO L225 Difference]: With dead ends: 356 [2023-11-06 22:01:20,503 INFO L226 Difference]: Without dead ends: 248 [2023-11-06 22:01:20,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:01:20,506 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 240 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:20,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 395 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:01:20,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-06 22:01:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 233. [2023-11-06 22:01:20,564 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) [2023-11-06 22:01:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 343 transitions. [2023-11-06 22:01:20,567 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 343 transitions. Word has length 101 [2023-11-06 22:01:20,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:20,568 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 343 transitions. [2023-11-06 22:01:20,568 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) [2023-11-06 22:01:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 343 transitions. [2023-11-06 22:01:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 22:01:20,579 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:20,579 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] [2023-11-06 22:01:20,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:20,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:20,781 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:20,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:20,781 INFO L85 PathProgramCache]: Analyzing trace with hash -213976846, now seen corresponding path program 1 times [2023-11-06 22:01:20,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:20,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354850337] [2023-11-06 22:01:20,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:20,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:20,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:21,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:01:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:21,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:01:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:21,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:01:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:21,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:01:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:21,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:01:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:21,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:01:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:21,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 22:01:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:21,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:01:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:21,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:01:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:01:21,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:21,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354850337] [2023-11-06 22:01:21,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354850337] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:21,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27130433] [2023-11-06 22:01:21,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:21,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:21,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:21,088 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:21,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:01:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:21,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:01:21,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 22:01:21,342 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:21,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27130433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:21,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:21,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-06 22:01:21,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826743536] [2023-11-06 22:01:21,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:21,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:01:21,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:21,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:01:21,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:01:21,345 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) [2023-11-06 22:01:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:21,648 INFO L93 Difference]: Finished difference Result 705 states and 1058 transitions. [2023-11-06 22:01:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:01:21,649 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 [2023-11-06 22:01:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:21,653 INFO L225 Difference]: With dead ends: 705 [2023-11-06 22:01:21,654 INFO L226 Difference]: Without dead ends: 485 [2023-11-06 22:01:21,655 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 [2023-11-06 22:01:21,656 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 237 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:21,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 383 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:01:21,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2023-11-06 22:01:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2023-11-06 22:01:21,746 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) [2023-11-06 22:01:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 700 transitions. [2023-11-06 22:01:21,751 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 700 transitions. Word has length 101 [2023-11-06 22:01:21,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:21,752 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 700 transitions. [2023-11-06 22:01:21,752 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) [2023-11-06 22:01:21,752 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 700 transitions. [2023-11-06 22:01:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 22:01:21,755 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:21,756 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] [2023-11-06 22:01:21,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:21,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:21,962 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:21,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:21,962 INFO L85 PathProgramCache]: Analyzing trace with hash 2077246898, now seen corresponding path program 1 times [2023-11-06 22:01:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:21,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834373610] [2023-11-06 22:01:21,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:21,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:22,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:22,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:01:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:22,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:01:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:22,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:01:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:22,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:01:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:22,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:01:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:22,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:01:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:22,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 22:01:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:22,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:01:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:22,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:01:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:01:22,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:22,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834373610] [2023-11-06 22:01:22,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834373610] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:22,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304299601] [2023-11-06 22:01:22,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:22,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:22,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:22,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:22,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:01:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:22,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:01:22,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 22:01:22,605 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:22,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304299601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:22,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:22,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-06 22:01:22,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906819511] [2023-11-06 22:01:22,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:22,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:01:22,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:22,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:01:22,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:01:22,609 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) [2023-11-06 22:01:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:23,017 INFO L93 Difference]: Finished difference Result 1557 states and 2395 transitions. [2023-11-06 22:01:23,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:01:23,018 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 [2023-11-06 22:01:23,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:23,032 INFO L225 Difference]: With dead ends: 1557 [2023-11-06 22:01:23,032 INFO L226 Difference]: Without dead ends: 1109 [2023-11-06 22:01:23,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:01:23,037 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 250 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:23,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 423 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:01:23,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2023-11-06 22:01:23,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1021. [2023-11-06 22:01:23,228 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) [2023-11-06 22:01:23,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1550 transitions. [2023-11-06 22:01:23,238 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1550 transitions. Word has length 101 [2023-11-06 22:01:23,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:23,238 INFO L495 AbstractCegarLoop]: Abstraction has 1021 states and 1550 transitions. [2023-11-06 22:01:23,239 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) [2023-11-06 22:01:23,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1550 transitions. [2023-11-06 22:01:23,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 22:01:23,246 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:23,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, 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] [2023-11-06 22:01:23,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:23,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:23,453 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:23,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:23,454 INFO L85 PathProgramCache]: Analyzing trace with hash -300696526, now seen corresponding path program 1 times [2023-11-06 22:01:23,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:23,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054320068] [2023-11-06 22:01:23,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:23,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:23,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:23,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:01:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:23,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:01:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:23,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:01:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:23,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:01:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:23,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:01:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:23,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:01:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:23,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 22:01:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:23,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:01:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:23,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:01:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:01:23,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:23,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054320068] [2023-11-06 22:01:23,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054320068] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:23,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442533611] [2023-11-06 22:01:23,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:23,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:23,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:23,716 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:23,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:01:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:23,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:01:23,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 22:01:23,959 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:23,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442533611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:23,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:23,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-06 22:01:23,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849159873] [2023-11-06 22:01:23,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:23,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:01:23,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:23,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:01:23,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:01:23,963 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) [2023-11-06 22:01:24,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:24,486 INFO L93 Difference]: Finished difference Result 3377 states and 5343 transitions. [2023-11-06 22:01:24,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:01:24,487 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 [2023-11-06 22:01:24,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:24,507 INFO L225 Difference]: With dead ends: 3377 [2023-11-06 22:01:24,507 INFO L226 Difference]: Without dead ends: 2393 [2023-11-06 22:01:24,512 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 [2023-11-06 22:01:24,513 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 245 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:24,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 411 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:01:24,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2023-11-06 22:01:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2261. [2023-11-06 22:01:24,872 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) [2023-11-06 22:01:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3538 transitions. [2023-11-06 22:01:24,897 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3538 transitions. Word has length 101 [2023-11-06 22:01:24,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:24,897 INFO L495 AbstractCegarLoop]: Abstraction has 2261 states and 3538 transitions. [2023-11-06 22:01:24,897 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) [2023-11-06 22:01:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3538 transitions. [2023-11-06 22:01:24,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 22:01:24,916 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:24,916 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] [2023-11-06 22:01:24,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:25,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 22:01:25,136 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:25,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:25,137 INFO L85 PathProgramCache]: Analyzing trace with hash 38237618, now seen corresponding path program 1 times [2023-11-06 22:01:25,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:25,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169028041] [2023-11-06 22:01:25,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:25,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:25,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:25,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:01:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:25,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:01:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:25,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:01:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:25,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:01:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:25,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:01:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:25,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:01:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:25,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 22:01:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:25,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:01:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:25,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:01:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:01:25,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:25,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169028041] [2023-11-06 22:01:25,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169028041] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:25,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783308567] [2023-11-06 22:01:25,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:25,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:25,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:25,346 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:25,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:01:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:25,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:01:25,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:01:25,559 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:25,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783308567] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:25,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:25,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-11-06 22:01:25,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477613889] [2023-11-06 22:01:25,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:25,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:01:25,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:25,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:01:25,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:01:25,562 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) [2023-11-06 22:01:25,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:25,895 INFO L93 Difference]: Finished difference Result 4789 states and 7470 transitions. [2023-11-06 22:01:25,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:01:25,896 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 [2023-11-06 22:01:25,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:25,917 INFO L225 Difference]: With dead ends: 4789 [2023-11-06 22:01:25,918 INFO L226 Difference]: Without dead ends: 2629 [2023-11-06 22:01:25,926 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 [2023-11-06 22:01:25,927 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 30 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:25,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 705 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:01:25,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2023-11-06 22:01:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2341. [2023-11-06 22:01:26,282 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) [2023-11-06 22:01:26,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 3634 transitions. [2023-11-06 22:01:26,305 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 3634 transitions. Word has length 101 [2023-11-06 22:01:26,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:26,305 INFO L495 AbstractCegarLoop]: Abstraction has 2341 states and 3634 transitions. [2023-11-06 22:01:26,305 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) [2023-11-06 22:01:26,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 3634 transitions. [2023-11-06 22:01:26,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 22:01:26,322 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:26,323 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] [2023-11-06 22:01:26,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:26,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-06 22:01:26,530 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:26,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:26,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1425023028, now seen corresponding path program 1 times [2023-11-06 22:01:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:26,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125339983] [2023-11-06 22:01:26,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:26,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:26,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:26,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:01:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:26,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:01:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:26,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:01:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:26,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:01:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:26,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:01:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:26,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:01:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:26,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 22:01:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:26,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:01:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:26,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:01:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:26,745 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:01:26,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:26,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125339983] [2023-11-06 22:01:26,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125339983] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:26,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462135446] [2023-11-06 22:01:26,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:26,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:26,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:26,747 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:26,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:01:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:26,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:01:26,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:01:26,943 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:26,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462135446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:26,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:26,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-06 22:01:26,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183914354] [2023-11-06 22:01:26,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:26,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:01:26,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:26,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:01:26,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:01:26,946 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) [2023-11-06 22:01:27,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:27,309 INFO L93 Difference]: Finished difference Result 5110 states and 7919 transitions. [2023-11-06 22:01:27,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:01:27,309 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 [2023-11-06 22:01:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:27,335 INFO L225 Difference]: With dead ends: 5110 [2023-11-06 22:01:27,335 INFO L226 Difference]: Without dead ends: 2870 [2023-11-06 22:01:27,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:01:27,345 INFO L413 NwaCegarLoop]: 141 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, 269 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 [2023-11-06 22:01:27,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 269 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:01:27,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2023-11-06 22:01:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2578. [2023-11-06 22:01:27,678 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) [2023-11-06 22:01:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3967 transitions. [2023-11-06 22:01:27,731 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3967 transitions. Word has length 101 [2023-11-06 22:01:27,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:27,731 INFO L495 AbstractCegarLoop]: Abstraction has 2578 states and 3967 transitions. [2023-11-06 22:01:27,732 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) [2023-11-06 22:01:27,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3967 transitions. [2023-11-06 22:01:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 22:01:27,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:27,749 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] [2023-11-06 22:01:27,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:27,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:27,969 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:27,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:27,969 INFO L85 PathProgramCache]: Analyzing trace with hash 457672374, now seen corresponding path program 1 times [2023-11-06 22:01:27,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:27,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443375627] [2023-11-06 22:01:27,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:27,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:28,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:28,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:01:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:28,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:01:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:28,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:01:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:28,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:01:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:28,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:01:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:28,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:01:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:28,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 22:01:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:28,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:01:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:28,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:01:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:01:28,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:28,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443375627] [2023-11-06 22:01:28,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443375627] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:28,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348124326] [2023-11-06 22:01:28,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:28,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:28,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:28,191 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:28,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:01:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:28,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:01:28,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-06 22:01:28,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:28,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348124326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:28,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:28,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-06 22:01:28,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225974442] [2023-11-06 22:01:28,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:28,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:01:28,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:28,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:01:28,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:01:28,409 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) [2023-11-06 22:01:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:28,870 INFO L93 Difference]: Finished difference Result 5010 states and 7692 transitions. [2023-11-06 22:01:28,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:01:28,871 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 [2023-11-06 22:01:28,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:28,896 INFO L225 Difference]: With dead ends: 5010 [2023-11-06 22:01:28,896 INFO L226 Difference]: Without dead ends: 2658 [2023-11-06 22:01:28,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:01:28,908 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 6 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:28,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 552 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:01:28,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2023-11-06 22:01:29,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2626. [2023-11-06 22:01:29,280 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) [2023-11-06 22:01:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4015 transitions. [2023-11-06 22:01:29,302 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 4015 transitions. Word has length 101 [2023-11-06 22:01:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:29,303 INFO L495 AbstractCegarLoop]: Abstraction has 2626 states and 4015 transitions. [2023-11-06 22:01:29,303 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) [2023-11-06 22:01:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 4015 transitions. [2023-11-06 22:01:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-06 22:01:29,322 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:29,324 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] [2023-11-06 22:01:29,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:29,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:29,530 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:29,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:29,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2122057235, now seen corresponding path program 1 times [2023-11-06 22:01:29,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:29,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681614951] [2023-11-06 22:01:29,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:29,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:29,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:29,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:01:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:29,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:01:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:29,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:01:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:29,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:01:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:29,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:01:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:29,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:01:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:29,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:01:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:29,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-06 22:01:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:29,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 22:01:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:01:29,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:29,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681614951] [2023-11-06 22:01:29,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681614951] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:29,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319412480] [2023-11-06 22:01:29,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:29,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:29,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:29,748 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:29,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:01:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:29,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:01:29,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:01:29,904 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:29,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319412480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:29,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:29,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-06 22:01:29,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368507629] [2023-11-06 22:01:29,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:29,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:01:29,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:29,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:01:29,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:01:29,908 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) [2023-11-06 22:01:30,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:30,246 INFO L93 Difference]: Finished difference Result 5324 states and 8539 transitions. [2023-11-06 22:01:30,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:01:30,247 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 [2023-11-06 22:01:30,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:30,270 INFO L225 Difference]: With dead ends: 5324 [2023-11-06 22:01:30,270 INFO L226 Difference]: Without dead ends: 2908 [2023-11-06 22:01:30,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:01:30,281 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 15 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 277 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 [2023-11-06 22:01:30,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 277 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:01:30,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2023-11-06 22:01:30,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2908. [2023-11-06 22:01:30,656 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) [2023-11-06 22:01:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 4555 transitions. [2023-11-06 22:01:30,677 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 4555 transitions. Word has length 104 [2023-11-06 22:01:30,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:30,678 INFO L495 AbstractCegarLoop]: Abstraction has 2908 states and 4555 transitions. [2023-11-06 22:01:30,678 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) [2023-11-06 22:01:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 4555 transitions. [2023-11-06 22:01:30,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-06 22:01:30,697 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:30,697 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] [2023-11-06 22:01:30,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:30,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 22:01:30,904 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:30,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:30,904 INFO L85 PathProgramCache]: Analyzing trace with hash 163482449, now seen corresponding path program 1 times [2023-11-06 22:01:30,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:30,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063482636] [2023-11-06 22:01:30,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:30,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:30,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:31,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:01:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:31,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:01:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:31,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:01:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:31,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:01:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:31,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:01:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:31,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:01:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:31,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:01:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:31,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-06 22:01:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:31,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 22:01:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:01:31,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:31,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063482636] [2023-11-06 22:01:31,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063482636] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:31,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703633364] [2023-11-06 22:01:31,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:31,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:31,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:31,086 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:31,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:01:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:31,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:01:31,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:01:31,317 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:31,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703633364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:31,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:31,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-06 22:01:31,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099802352] [2023-11-06 22:01:31,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:31,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:01:31,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:31,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:01:31,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:01:31,320 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) [2023-11-06 22:01:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:32,411 INFO L93 Difference]: Finished difference Result 9208 states and 15036 transitions. [2023-11-06 22:01:32,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:01:32,412 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 [2023-11-06 22:01:32,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:32,475 INFO L225 Difference]: With dead ends: 9208 [2023-11-06 22:01:32,475 INFO L226 Difference]: Without dead ends: 6558 [2023-11-06 22:01:32,490 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 [2023-11-06 22:01:32,491 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 209 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 731 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.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:32,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 731 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:01:32,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6558 states. [2023-11-06 22:01:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6558 to 6458. [2023-11-06 22:01:33,473 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) [2023-11-06 22:01:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 10347 transitions. [2023-11-06 22:01:33,520 INFO L78 Accepts]: Start accepts. Automaton has 6458 states and 10347 transitions. Word has length 104 [2023-11-06 22:01:33,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:33,521 INFO L495 AbstractCegarLoop]: Abstraction has 6458 states and 10347 transitions. [2023-11-06 22:01:33,521 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) [2023-11-06 22:01:33,521 INFO L276 IsEmpty]: Start isEmpty. Operand 6458 states and 10347 transitions. [2023-11-06 22:01:33,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-06 22:01:33,613 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:33,613 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] [2023-11-06 22:01:33,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:33,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-06 22:01:33,820 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:33,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:33,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1052671277, now seen corresponding path program 1 times [2023-11-06 22:01:33,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:33,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642808920] [2023-11-06 22:01:33,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:33,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:33,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:33,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:01:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:34,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:01:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:34,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:01:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:34,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:01:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:34,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:01:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:34,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:01:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:34,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:01:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:34,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-06 22:01:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:34,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 22:01:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:01:34,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:34,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642808920] [2023-11-06 22:01:34,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642808920] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:34,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999847753] [2023-11-06 22:01:34,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:34,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:34,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:34,056 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:34,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 22:01:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:34,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:01:34,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 22:01:34,249 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:34,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999847753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:34,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:34,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2023-11-06 22:01:34,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241860507] [2023-11-06 22:01:34,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:34,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:01:34,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:34,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:01:34,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:01:34,253 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) [2023-11-06 22:01:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:35,630 INFO L93 Difference]: Finished difference Result 14114 states and 22261 transitions. [2023-11-06 22:01:35,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:01:35,631 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 [2023-11-06 22:01:35,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:35,700 INFO L225 Difference]: With dead ends: 14114 [2023-11-06 22:01:35,700 INFO L226 Difference]: Without dead ends: 7922 [2023-11-06 22:01:35,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:01:35,736 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 72 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:35,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 370 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:01:35,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2023-11-06 22:01:36,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 6458. [2023-11-06 22:01:36,788 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) [2023-11-06 22:01:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 10345 transitions. [2023-11-06 22:01:36,823 INFO L78 Accepts]: Start accepts. Automaton has 6458 states and 10345 transitions. Word has length 104 [2023-11-06 22:01:36,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:36,824 INFO L495 AbstractCegarLoop]: Abstraction has 6458 states and 10345 transitions. [2023-11-06 22:01:36,825 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) [2023-11-06 22:01:36,825 INFO L276 IsEmpty]: Start isEmpty. Operand 6458 states and 10345 transitions. [2023-11-06 22:01:36,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-06 22:01:36,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:36,893 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] [2023-11-06 22:01:36,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:37,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 22:01:37,100 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:37,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:37,100 INFO L85 PathProgramCache]: Analyzing trace with hash -611500932, now seen corresponding path program 1 times [2023-11-06 22:01:37,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:37,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864442025] [2023-11-06 22:01:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:37,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:37,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:37,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:01:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:37,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:01:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:37,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:01:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:37,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:01:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:37,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:01:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:37,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:01:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:37,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:01:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:37,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 22:01:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:37,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:01:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:37,302 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:01:37,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:37,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864442025] [2023-11-06 22:01:37,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864442025] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:37,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65245045] [2023-11-06 22:01:37,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:37,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:37,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:37,306 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:37,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 22:01:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:37,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:01:37,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:01:37,473 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:37,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65245045] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:37,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:37,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-06 22:01:37,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292825536] [2023-11-06 22:01:37,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:37,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:01:37,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:37,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:01:37,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:01:37,480 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) [2023-11-06 22:01:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:38,414 INFO L93 Difference]: Finished difference Result 12874 states and 20913 transitions. [2023-11-06 22:01:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:01:38,415 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 [2023-11-06 22:01:38,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:38,469 INFO L225 Difference]: With dead ends: 12874 [2023-11-06 22:01:38,469 INFO L226 Difference]: Without dead ends: 6894 [2023-11-06 22:01:38,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:01:38,502 INFO L413 NwaCegarLoop]: 147 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, 283 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 [2023-11-06 22:01:38,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 283 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:01:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6894 states. [2023-11-06 22:01:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6894 to 6894. [2023-11-06 22:01:39,502 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) [2023-11-06 22:01:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6894 states to 6894 states and 11161 transitions. [2023-11-06 22:01:39,539 INFO L78 Accepts]: Start accepts. Automaton has 6894 states and 11161 transitions. Word has length 107 [2023-11-06 22:01:39,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:39,540 INFO L495 AbstractCegarLoop]: Abstraction has 6894 states and 11161 transitions. [2023-11-06 22:01:39,540 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) [2023-11-06 22:01:39,540 INFO L276 IsEmpty]: Start isEmpty. Operand 6894 states and 11161 transitions. [2023-11-06 22:01:39,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-06 22:01:39,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:39,574 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] [2023-11-06 22:01:39,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:39,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 22:01:39,780 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:39,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:39,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1264981886, now seen corresponding path program 1 times [2023-11-06 22:01:39,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:39,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914061789] [2023-11-06 22:01:39,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:39,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:39,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:39,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:01:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:39,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:01:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:39,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:01:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:39,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:01:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:39,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:01:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:39,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:01:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:39,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:01:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:39,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 22:01:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:39,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:01:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:01:40,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:40,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914061789] [2023-11-06 22:01:40,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914061789] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:40,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974221659] [2023-11-06 22:01:40,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:40,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:40,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:40,005 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:40,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 22:01:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:40,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:01:40,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:40,262 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:01:40,262 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:40,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974221659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:40,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:40,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-06 22:01:40,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392548375] [2023-11-06 22:01:40,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:40,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:01:40,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:40,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:01:40,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:01:40,265 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) [2023-11-06 22:01:41,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:41,512 INFO L93 Difference]: Finished difference Result 13370 states and 21103 transitions. [2023-11-06 22:01:41,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:01:41,513 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 [2023-11-06 22:01:41,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:41,560 INFO L225 Difference]: With dead ends: 13370 [2023-11-06 22:01:41,560 INFO L226 Difference]: Without dead ends: 7018 [2023-11-06 22:01:41,590 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 [2023-11-06 22:01:41,591 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 197 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:41,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 695 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:01:41,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7018 states. [2023-11-06 22:01:42,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7018 to 7014. [2023-11-06 22:01:42,571 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) [2023-11-06 22:01:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 10881 transitions. [2023-11-06 22:01:42,602 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 10881 transitions. Word has length 107 [2023-11-06 22:01:42,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:42,603 INFO L495 AbstractCegarLoop]: Abstraction has 7014 states and 10881 transitions. [2023-11-06 22:01:42,603 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) [2023-11-06 22:01:42,603 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 10881 transitions. [2023-11-06 22:01:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-06 22:01:42,631 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:42,631 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] [2023-11-06 22:01:42,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:42,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-06 22:01:42,837 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:42,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:42,838 INFO L85 PathProgramCache]: Analyzing trace with hash -549218888, now seen corresponding path program 2 times [2023-11-06 22:01:42,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:42,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754991731] [2023-11-06 22:01:42,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:42,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:42,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:42,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:01:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:42,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:01:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:42,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:01:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:42,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:01:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:43,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:01:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:43,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:01:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:43,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:01:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:43,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 22:01:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:43,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:01:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:01:43,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:43,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754991731] [2023-11-06 22:01:43,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754991731] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:43,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244244567] [2023-11-06 22:01:43,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:01:43,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:43,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:43,023 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:43,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-06 22:01:43,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:01:43,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:01:43,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:01:43,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-06 22:01:43,182 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:43,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244244567] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:43,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:43,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-06 22:01:43,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911377879] [2023-11-06 22:01:43,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:43,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:01:43,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:43,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:01:43,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:01:43,186 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) [2023-11-06 22:01:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:44,274 INFO L93 Difference]: Finished difference Result 10122 states and 18596 transitions. [2023-11-06 22:01:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:01:44,274 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 [2023-11-06 22:01:44,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:44,341 INFO L225 Difference]: With dead ends: 10122 [2023-11-06 22:01:44,341 INFO L226 Difference]: Without dead ends: 10118 [2023-11-06 22:01:44,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:01:44,350 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 81 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:44,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 789 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:01:44,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10118 states. [2023-11-06 22:01:45,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10118 to 7206. [2023-11-06 22:01:45,183 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) [2023-11-06 22:01:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7206 states to 7206 states and 11073 transitions. [2023-11-06 22:01:45,219 INFO L78 Accepts]: Start accepts. Automaton has 7206 states and 11073 transitions. Word has length 107 [2023-11-06 22:01:45,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:45,220 INFO L495 AbstractCegarLoop]: Abstraction has 7206 states and 11073 transitions. [2023-11-06 22:01:45,220 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) [2023-11-06 22:01:45,220 INFO L276 IsEmpty]: Start isEmpty. Operand 7206 states and 11073 transitions. [2023-11-06 22:01:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-06 22:01:45,250 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:45,250 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] [2023-11-06 22:01:45,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:45,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 22:01:45,456 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:45,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:45,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1225788474, now seen corresponding path program 1 times [2023-11-06 22:01:45,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:45,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524823836] [2023-11-06 22:01:45,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:45,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:45,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:45,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:01:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:45,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:01:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:45,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:01:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:45,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:01:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:45,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:01:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:45,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:01:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:45,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:01:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:45,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 22:01:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:45,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:01:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:01:45,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:45,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524823836] [2023-11-06 22:01:45,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524823836] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:45,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880000176] [2023-11-06 22:01:45,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:45,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:45,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:45,634 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:45,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-06 22:01:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:45,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:01:45,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:45,821 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-06 22:01:45,822 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:45,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880000176] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:45,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:45,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-11-06 22:01:45,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877060986] [2023-11-06 22:01:45,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:45,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:01:45,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:45,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:01:45,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:01:45,826 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) [2023-11-06 22:01:46,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:46,706 INFO L93 Difference]: Finished difference Result 13758 states and 20745 transitions. [2023-11-06 22:01:46,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:01:46,707 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 [2023-11-06 22:01:46,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:46,742 INFO L225 Difference]: With dead ends: 13758 [2023-11-06 22:01:46,742 INFO L226 Difference]: Without dead ends: 7110 [2023-11-06 22:01:46,760 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 [2023-11-06 22:01:46,761 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 4 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:46,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 692 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:01:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7110 states. [2023-11-06 22:01:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7110 to 7110. [2023-11-06 22:01:47,961 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) [2023-11-06 22:01:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7110 states to 7110 states and 10913 transitions. [2023-11-06 22:01:48,007 INFO L78 Accepts]: Start accepts. Automaton has 7110 states and 10913 transitions. Word has length 107 [2023-11-06 22:01:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:48,007 INFO L495 AbstractCegarLoop]: Abstraction has 7110 states and 10913 transitions. [2023-11-06 22:01:48,008 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) [2023-11-06 22:01:48,008 INFO L276 IsEmpty]: Start isEmpty. Operand 7110 states and 10913 transitions. [2023-11-06 22:01:48,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-06 22:01:48,045 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:48,046 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] [2023-11-06 22:01:48,057 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-06 22:01:48,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 22:01:48,257 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:48,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:48,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1916204999, now seen corresponding path program 1 times [2023-11-06 22:01:48,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:48,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13507300] [2023-11-06 22:01:48,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:48,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:48,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:48,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:01:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:48,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:01:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:48,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:01:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:48,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:01:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:48,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:01:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:48,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:01:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:48,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:01:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:48,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:01:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:48,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-06 22:01:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-06 22:01:48,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:48,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13507300] [2023-11-06 22:01:48,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13507300] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:48,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141792635] [2023-11-06 22:01:48,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:48,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:48,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:48,478 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:48,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-06 22:01:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:48,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:01:48,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:48,687 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:01:48,688 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:48,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141792635] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:48,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:48,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2023-11-06 22:01:48,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445037880] [2023-11-06 22:01:48,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:48,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:01:48,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:48,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:01:48,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:01:48,693 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) [2023-11-06 22:01:49,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:49,930 INFO L93 Difference]: Finished difference Result 15142 states and 23023 transitions. [2023-11-06 22:01:49,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:01:49,931 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 [2023-11-06 22:01:49,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:49,980 INFO L225 Difference]: With dead ends: 15142 [2023-11-06 22:01:49,980 INFO L226 Difference]: Without dead ends: 8334 [2023-11-06 22:01:50,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:01:50,007 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 85 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:50,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 288 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:01:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8334 states. [2023-11-06 22:01:51,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8334 to 7110. [2023-11-06 22:01:51,171 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) [2023-11-06 22:01:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7110 states to 7110 states and 10909 transitions. [2023-11-06 22:01:51,204 INFO L78 Accepts]: Start accepts. Automaton has 7110 states and 10909 transitions. Word has length 110 [2023-11-06 22:01:51,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:51,205 INFO L495 AbstractCegarLoop]: Abstraction has 7110 states and 10909 transitions. [2023-11-06 22:01:51,205 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) [2023-11-06 22:01:51,205 INFO L276 IsEmpty]: Start isEmpty. Operand 7110 states and 10909 transitions. [2023-11-06 22:01:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-06 22:01:51,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:51,233 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] [2023-11-06 22:01:51,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:51,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-06 22:01:51,439 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:51,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:51,440 INFO L85 PathProgramCache]: Analyzing trace with hash -406385611, now seen corresponding path program 1 times [2023-11-06 22:01:51,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:51,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807380297] [2023-11-06 22:01:51,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:51,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:51,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:51,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:01:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:51,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:01:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:51,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:01:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:51,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:01:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:51,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:01:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:51,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:01:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:51,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 22:01:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:51,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 22:01:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:51,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:01:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-06 22:01:51,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:51,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807380297] [2023-11-06 22:01:51,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807380297] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:51,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421880349] [2023-11-06 22:01:51,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:51,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:51,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:51,623 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:51,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-06 22:01:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:51,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:01:51,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:01:51,791 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:51,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421880349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:51,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:51,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-06 22:01:51,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058020566] [2023-11-06 22:01:51,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:51,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:01:51,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:51,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:01:51,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:01:51,794 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) [2023-11-06 22:01:52,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:52,514 INFO L93 Difference]: Finished difference Result 14358 states and 22185 transitions. [2023-11-06 22:01:52,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:01:52,515 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 [2023-11-06 22:01:52,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:52,556 INFO L225 Difference]: With dead ends: 14358 [2023-11-06 22:01:52,556 INFO L226 Difference]: Without dead ends: 7774 [2023-11-06 22:01:52,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:01:52,579 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 21 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 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 [2023-11-06 22:01:52,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 281 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:01:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7774 states. [2023-11-06 22:01:53,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7774 to 7774. [2023-11-06 22:01:53,815 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) [2023-11-06 22:01:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7774 states to 7774 states and 12001 transitions. [2023-11-06 22:01:53,850 INFO L78 Accepts]: Start accepts. Automaton has 7774 states and 12001 transitions. Word has length 113 [2023-11-06 22:01:53,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:53,851 INFO L495 AbstractCegarLoop]: Abstraction has 7774 states and 12001 transitions. [2023-11-06 22:01:53,853 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) [2023-11-06 22:01:53,853 INFO L276 IsEmpty]: Start isEmpty. Operand 7774 states and 12001 transitions. [2023-11-06 22:01:53,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-06 22:01:53,886 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:53,886 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] [2023-11-06 22:01:53,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:54,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 22:01:54,093 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:54,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:54,093 INFO L85 PathProgramCache]: Analyzing trace with hash -992661833, now seen corresponding path program 1 times [2023-11-06 22:01:54,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:54,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109641718] [2023-11-06 22:01:54,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:54,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:54,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:54,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:01:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:54,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:01:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:54,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:01:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:54,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:01:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:54,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:01:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:54,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:01:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:54,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 22:01:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:54,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 22:01:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:54,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:01:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-06 22:01:54,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:54,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109641718] [2023-11-06 22:01:54,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109641718] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:54,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223283243] [2023-11-06 22:01:54,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:54,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:54,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:54,270 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:54,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-06 22:01:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:54,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:01:54,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:54,514 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:01:54,514 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:54,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223283243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:54,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:54,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-06 22:01:54,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752563782] [2023-11-06 22:01:54,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:54,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:01:54,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:54,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:01:54,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:01:54,519 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) [2023-11-06 22:01:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:55,613 INFO L93 Difference]: Finished difference Result 15082 states and 22658 transitions. [2023-11-06 22:01:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:01:55,614 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 [2023-11-06 22:01:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:55,652 INFO L225 Difference]: With dead ends: 15082 [2023-11-06 22:01:55,652 INFO L226 Difference]: Without dead ends: 7922 [2023-11-06 22:01:55,752 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 [2023-11-06 22:01:55,753 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 194 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:55,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 650 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:01:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2023-11-06 22:01:56,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 7918. [2023-11-06 22:01:56,684 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) [2023-11-06 22:01:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7918 states to 7918 states and 11757 transitions. [2023-11-06 22:01:56,716 INFO L78 Accepts]: Start accepts. Automaton has 7918 states and 11757 transitions. Word has length 113 [2023-11-06 22:01:56,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:56,716 INFO L495 AbstractCegarLoop]: Abstraction has 7918 states and 11757 transitions. [2023-11-06 22:01:56,716 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) [2023-11-06 22:01:56,716 INFO L276 IsEmpty]: Start isEmpty. Operand 7918 states and 11757 transitions. [2023-11-06 22:01:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-06 22:01:56,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:56,746 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] [2023-11-06 22:01:56,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:56,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:56,953 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:56,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:56,953 INFO L85 PathProgramCache]: Analyzing trace with hash -38721675, now seen corresponding path program 1 times [2023-11-06 22:01:56,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:56,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068051815] [2023-11-06 22:01:56,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:56,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:01:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:01:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:01:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:01:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:01:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:01:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:01:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 22:01:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 22:01:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:01:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-06 22:01:57,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:57,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068051815] [2023-11-06 22:01:57,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068051815] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:57,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219143352] [2023-11-06 22:01:57,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:57,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:57,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:57,130 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:57,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-06 22:01:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:01:57,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:57,350 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:01:57,350 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:57,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219143352] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:57,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:01:57,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2023-11-06 22:01:57,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174778468] [2023-11-06 22:01:57,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:57,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:01:57,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:57,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:01:57,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:01:57,353 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) [2023-11-06 22:01:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:58,589 INFO L93 Difference]: Finished difference Result 16338 states and 24119 transitions. [2023-11-06 22:01:58,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:01:58,590 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 [2023-11-06 22:01:58,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:58,630 INFO L225 Difference]: With dead ends: 16338 [2023-11-06 22:01:58,630 INFO L226 Difference]: Without dead ends: 8782 [2023-11-06 22:01:58,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:01:58,651 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 78 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:58,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 334 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:01:58,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8782 states. [2023-11-06 22:01:59,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8782 to 7918. [2023-11-06 22:01:59,936 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) [2023-11-06 22:01:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7918 states to 7918 states and 11749 transitions. [2023-11-06 22:01:59,971 INFO L78 Accepts]: Start accepts. Automaton has 7918 states and 11749 transitions. Word has length 113 [2023-11-06 22:01:59,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:59,971 INFO L495 AbstractCegarLoop]: Abstraction has 7918 states and 11749 transitions. [2023-11-06 22:01:59,971 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) [2023-11-06 22:01:59,971 INFO L276 IsEmpty]: Start isEmpty. Operand 7918 states and 11749 transitions. [2023-11-06 22:02:00,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 22:02:00,009 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:00,009 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] [2023-11-06 22:02:00,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:00,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:00,215 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:00,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1693209122, now seen corresponding path program 1 times [2023-11-06 22:02:00,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:00,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750544722] [2023-11-06 22:02:00,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:00,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:02:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:02:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:02:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:02:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:02:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:02:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:02:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:02:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:02:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-06 22:02:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,414 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 22:02:00,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:00,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750544722] [2023-11-06 22:02:00,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750544722] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:00,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919264059] [2023-11-06 22:02:00,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:00,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:00,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:00,417 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:00,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-06 22:02:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:02:00,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:00,595 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:02:00,596 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:00,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919264059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:00,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:02:00,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-06 22:02:00,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110894961] [2023-11-06 22:02:00,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:00,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:02:00,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:00,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:02:00,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:02:00,599 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) [2023-11-06 22:02:01,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:01,938 INFO L93 Difference]: Finished difference Result 16238 states and 24098 transitions. [2023-11-06 22:02:01,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:02:01,938 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 [2023-11-06 22:02:01,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:01,981 INFO L225 Difference]: With dead ends: 16238 [2023-11-06 22:02:01,982 INFO L226 Difference]: Without dead ends: 8918 [2023-11-06 22:02:02,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:02:02,002 INFO L413 NwaCegarLoop]: 147 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, 283 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 [2023-11-06 22:02:02,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 283 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:02:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8918 states. [2023-11-06 22:02:03,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8918 to 8918. [2023-11-06 22:02:03,123 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) [2023-11-06 22:02:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8918 states to 8918 states and 13240 transitions. [2023-11-06 22:02:03,149 INFO L78 Accepts]: Start accepts. Automaton has 8918 states and 13240 transitions. Word has length 116 [2023-11-06 22:02:03,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:03,149 INFO L495 AbstractCegarLoop]: Abstraction has 8918 states and 13240 transitions. [2023-11-06 22:02:03,150 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) [2023-11-06 22:02:03,150 INFO L276 IsEmpty]: Start isEmpty. Operand 8918 states and 13240 transitions. [2023-11-06 22:02:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 22:02:03,172 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:03,172 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] [2023-11-06 22:02:03,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:03,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-06 22:02:03,373 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:03,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:03,373 INFO L85 PathProgramCache]: Analyzing trace with hash -265365664, now seen corresponding path program 1 times [2023-11-06 22:02:03,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:03,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330111938] [2023-11-06 22:02:03,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:03,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:03,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:02:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:03,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:02:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:03,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:02:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:03,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:02:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:03,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:02:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:03,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:02:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:03,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:02:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:03,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:02:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:03,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:02:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:03,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-06 22:02:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:03,545 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 22:02:03,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:03,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330111938] [2023-11-06 22:02:03,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330111938] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:03,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553274177] [2023-11-06 22:02:03,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:03,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:03,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:03,548 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:03,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-06 22:02:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:03,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:02:03,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:02:03,795 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:03,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553274177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:03,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:02:03,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-11-06 22:02:03,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587493524] [2023-11-06 22:02:03,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:03,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:02:03,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:03,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:02:03,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:02:03,797 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) [2023-11-06 22:02:05,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:05,068 INFO L93 Difference]: Finished difference Result 17280 states and 24901 transitions. [2023-11-06 22:02:05,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:02:05,069 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 [2023-11-06 22:02:05,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:05,111 INFO L225 Difference]: With dead ends: 17280 [2023-11-06 22:02:05,111 INFO L226 Difference]: Without dead ends: 9084 [2023-11-06 22:02:05,136 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 [2023-11-06 22:02:05,137 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 189 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:05,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 620 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:02:05,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9084 states. [2023-11-06 22:02:06,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9084 to 9080. [2023-11-06 22:02:06,445 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) [2023-11-06 22:02:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9080 states to 9080 states and 12993 transitions. [2023-11-06 22:02:06,486 INFO L78 Accepts]: Start accepts. Automaton has 9080 states and 12993 transitions. Word has length 116 [2023-11-06 22:02:06,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:06,487 INFO L495 AbstractCegarLoop]: Abstraction has 9080 states and 12993 transitions. [2023-11-06 22:02:06,487 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) [2023-11-06 22:02:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 9080 states and 12993 transitions. [2023-11-06 22:02:06,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 22:02:06,512 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:06,512 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] [2023-11-06 22:02:06,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:06,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:06,714 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:06,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:06,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1481519390, now seen corresponding path program 1 times [2023-11-06 22:02:06,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:06,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114964168] [2023-11-06 22:02:06,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:06,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:06,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:02:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:06,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:02:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:06,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:02:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:06,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:02:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:06,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:02:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:06,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:02:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:06,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:02:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:06,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:02:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:06,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:02:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:06,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-06 22:02:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 22:02:06,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:06,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114964168] [2023-11-06 22:02:06,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114964168] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:06,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420119994] [2023-11-06 22:02:06,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:06,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:06,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:06,994 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:07,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-06 22:02:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:07,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:02:07,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:07,220 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:02:07,220 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:07,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420119994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:07,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:02:07,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2023-11-06 22:02:07,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475720662] [2023-11-06 22:02:07,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:07,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:02:07,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:07,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:02:07,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:02:07,223 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) [2023-11-06 22:02:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:08,227 INFO L93 Difference]: Finished difference Result 14370 states and 20213 transitions. [2023-11-06 22:02:08,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:02:08,228 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 [2023-11-06 22:02:08,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:08,255 INFO L225 Difference]: With dead ends: 14370 [2023-11-06 22:02:08,255 INFO L226 Difference]: Without dead ends: 5904 [2023-11-06 22:02:08,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:02:08,277 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 81 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:08,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 543 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:02:08,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5904 states. [2023-11-06 22:02:08,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5904 to 5808. [2023-11-06 22:02:08,966 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) [2023-11-06 22:02:08,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5808 states to 5808 states and 8282 transitions. [2023-11-06 22:02:08,985 INFO L78 Accepts]: Start accepts. Automaton has 5808 states and 8282 transitions. Word has length 116 [2023-11-06 22:02:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:08,986 INFO L495 AbstractCegarLoop]: Abstraction has 5808 states and 8282 transitions. [2023-11-06 22:02:08,986 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) [2023-11-06 22:02:08,986 INFO L276 IsEmpty]: Start isEmpty. Operand 5808 states and 8282 transitions. [2023-11-06 22:02:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 22:02:09,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:09,004 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] [2023-11-06 22:02:09,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:09,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:09,204 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:09,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash -961227544, now seen corresponding path program 1 times [2023-11-06 22:02:09,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:09,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340476591] [2023-11-06 22:02:09,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:09,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:09,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:02:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:09,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:02:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:09,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:02:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:09,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:02:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:09,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:02:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:09,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:02:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:09,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:02:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:09,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:02:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:09,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:02:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:09,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-06 22:02:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:09,430 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-06 22:02:09,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:09,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340476591] [2023-11-06 22:02:09,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340476591] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:09,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077070376] [2023-11-06 22:02:09,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:09,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:09,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:09,433 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:09,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-06 22:02:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:09,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:02:09,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:02:09,755 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:09,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077070376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:09,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:02:09,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-06 22:02:09,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947910937] [2023-11-06 22:02:09,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:09,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:02:09,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:09,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:02:09,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:02:09,759 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) [2023-11-06 22:02:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:10,654 INFO L93 Difference]: Finished difference Result 11110 states and 15539 transitions. [2023-11-06 22:02:10,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:02:10,655 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 [2023-11-06 22:02:10,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:10,675 INFO L225 Difference]: With dead ends: 11110 [2023-11-06 22:02:10,676 INFO L226 Difference]: Without dead ends: 5496 [2023-11-06 22:02:10,691 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 [2023-11-06 22:02:10,692 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 2 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:10,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 362 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:02:10,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5496 states. [2023-11-06 22:02:11,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5496 to 5496. [2023-11-06 22:02:11,415 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) [2023-11-06 22:02:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5496 states to 5496 states and 7528 transitions. [2023-11-06 22:02:11,433 INFO L78 Accepts]: Start accepts. Automaton has 5496 states and 7528 transitions. Word has length 116 [2023-11-06 22:02:11,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:11,433 INFO L495 AbstractCegarLoop]: Abstraction has 5496 states and 7528 transitions. [2023-11-06 22:02:11,433 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) [2023-11-06 22:02:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 5496 states and 7528 transitions. [2023-11-06 22:02:11,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:02:11,445 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:11,445 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] [2023-11-06 22:02:11,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:11,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-06 22:02:11,646 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:11,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:11,646 INFO L85 PathProgramCache]: Analyzing trace with hash 230421370, now seen corresponding path program 1 times [2023-11-06 22:02:11,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:11,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338983251] [2023-11-06 22:02:11,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:11,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:11,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:02:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:11,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:02:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:11,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:02:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:11,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:02:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:11,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:02:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:11,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:02:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:11,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:02:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:11,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:02:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:11,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-06 22:02:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:11,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 22:02:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:11,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 22:02:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-06 22:02:11,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:11,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338983251] [2023-11-06 22:02:11,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338983251] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:11,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828550668] [2023-11-06 22:02:11,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:11,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:11,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:11,884 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:11,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-06 22:02:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:12,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:02:12,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:02:12,113 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:12,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828550668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:12,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:02:12,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-11-06 22:02:12,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535641297] [2023-11-06 22:02:12,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:12,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:02:12,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:12,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:02:12,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:02:12,117 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) [2023-11-06 22:02:12,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:12,722 INFO L93 Difference]: Finished difference Result 10786 states and 14702 transitions. [2023-11-06 22:02:12,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:02:12,723 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 [2023-11-06 22:02:12,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:12,735 INFO L225 Difference]: With dead ends: 10786 [2023-11-06 22:02:12,735 INFO L226 Difference]: Without dead ends: 5592 [2023-11-06 22:02:12,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:02:12,743 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 3 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:12,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 273 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:02:12,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5592 states. [2023-11-06 22:02:13,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5592 to 5544. [2023-11-06 22:02:13,272 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) [2023-11-06 22:02:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7576 transitions. [2023-11-06 22:02:13,289 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7576 transitions. Word has length 131 [2023-11-06 22:02:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:13,289 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7576 transitions. [2023-11-06 22:02:13,289 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) [2023-11-06 22:02:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7576 transitions. [2023-11-06 22:02:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-06 22:02:13,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:13,300 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] [2023-11-06 22:02:13,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-11-06 22:02:13,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-06 22:02:13,501 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:13,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:13,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1879876967, now seen corresponding path program 1 times [2023-11-06 22:02:13,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:13,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033517091] [2023-11-06 22:02:13,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:13,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:13,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:02:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:13,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:02:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:13,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:02:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:13,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:02:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:13,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:02:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:13,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:02:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:13,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-06 22:02:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:13,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 22:02:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:13,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:02:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:13,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:02:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:13,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-06 22:02:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-06 22:02:13,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:13,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033517091] [2023-11-06 22:02:13,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033517091] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:13,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524412087] [2023-11-06 22:02:13,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:13,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:13,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:13,741 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:13,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-06 22:02:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:13,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:02:13,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:02:13,910 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:13,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524412087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:13,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:02:13,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-11-06 22:02:13,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300550745] [2023-11-06 22:02:13,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:13,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:02:13,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:13,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:02:13,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:02:13,914 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) [2023-11-06 22:02:14,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:14,639 INFO L93 Difference]: Finished difference Result 10818 states and 14670 transitions. [2023-11-06 22:02:14,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:02:14,639 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 [2023-11-06 22:02:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:14,653 INFO L225 Difference]: With dead ends: 10818 [2023-11-06 22:02:14,653 INFO L226 Difference]: Without dead ends: 5576 [2023-11-06 22:02:14,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:02:14,663 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 7 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:14,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 268 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:02:14,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5576 states. [2023-11-06 22:02:15,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5576 to 5544. [2023-11-06 22:02:15,291 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) [2023-11-06 22:02:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7528 transitions. [2023-11-06 22:02:15,307 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7528 transitions. Word has length 132 [2023-11-06 22:02:15,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:15,307 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7528 transitions. [2023-11-06 22:02:15,308 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) [2023-11-06 22:02:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7528 transitions. [2023-11-06 22:02:15,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-06 22:02:15,322 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:15,322 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] [2023-11-06 22:02:15,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:15,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:15,523 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:15,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:15,524 INFO L85 PathProgramCache]: Analyzing trace with hash 412574584, now seen corresponding path program 1 times [2023-11-06 22:02:15,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:15,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216405970] [2023-11-06 22:02:15,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:15,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:15,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:02:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:15,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:02:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:15,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:02:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:15,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:02:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:15,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:02:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:15,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:02:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:15,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-06 22:02:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:15,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 22:02:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:15,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:02:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:15,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:02:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:15,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-06 22:02:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-06 22:02:15,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:15,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216405970] [2023-11-06 22:02:15,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216405970] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:15,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044876305] [2023-11-06 22:02:15,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:15,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:15,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:15,769 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:15,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-06 22:02:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:15,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:02:15,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:02:16,136 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:16,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044876305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:16,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:02:16,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-11-06 22:02:16,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53813997] [2023-11-06 22:02:16,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:16,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:02:16,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:16,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:02:16,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:02:16,139 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) [2023-11-06 22:02:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:16,983 INFO L93 Difference]: Finished difference Result 10786 states and 14542 transitions. [2023-11-06 22:02:16,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:02:16,984 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 [2023-11-06 22:02:16,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:16,999 INFO L225 Difference]: With dead ends: 10786 [2023-11-06 22:02:16,999 INFO L226 Difference]: Without dead ends: 5544 [2023-11-06 22:02:17,007 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 [2023-11-06 22:02:17,008 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 222 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:17,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 145 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:02:17,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5544 states. [2023-11-06 22:02:17,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5544 to 5544. [2023-11-06 22:02:17,779 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) [2023-11-06 22:02:17,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7512 transitions. [2023-11-06 22:02:17,795 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7512 transitions. Word has length 132 [2023-11-06 22:02:17,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:17,796 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7512 transitions. [2023-11-06 22:02:17,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) [2023-11-06 22:02:17,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7512 transitions. [2023-11-06 22:02:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 22:02:17,811 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:17,812 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] [2023-11-06 22:02:17,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:18,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-06 22:02:18,012 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:18,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash -878588795, now seen corresponding path program 1 times [2023-11-06 22:02:18,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:18,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150283738] [2023-11-06 22:02:18,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:18,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:18,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:02:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:18,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:02:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:18,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:02:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:18,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:02:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:18,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:02:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:18,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:02:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:18,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:02:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:18,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-06 22:02:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:18,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:02:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:18,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:02:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:18,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:02:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:18,383 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-06 22:02:18,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:18,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150283738] [2023-11-06 22:02:18,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150283738] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:18,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411442610] [2023-11-06 22:02:18,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:18,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:18,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:18,385 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:18,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-11-06 22:02:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:18,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:02:18,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:02:18,568 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:18,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411442610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:18,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:02:18,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-11-06 22:02:18,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178796177] [2023-11-06 22:02:18,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:18,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:02:18,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:18,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:02:18,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:02:18,571 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) [2023-11-06 22:02:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:19,151 INFO L93 Difference]: Finished difference Result 10978 states and 14782 transitions. [2023-11-06 22:02:19,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:02:19,152 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 [2023-11-06 22:02:19,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:19,165 INFO L225 Difference]: With dead ends: 10978 [2023-11-06 22:02:19,165 INFO L226 Difference]: Without dead ends: 5736 [2023-11-06 22:02:19,174 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 [2023-11-06 22:02:19,174 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 11 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:19,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 276 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:02:19,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5736 states. [2023-11-06 22:02:19,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5736 to 5656. [2023-11-06 22:02:19,840 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) [2023-11-06 22:02:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 7656 transitions. [2023-11-06 22:02:19,856 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 7656 transitions. Word has length 133 [2023-11-06 22:02:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:19,857 INFO L495 AbstractCegarLoop]: Abstraction has 5656 states and 7656 transitions. [2023-11-06 22:02:19,857 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) [2023-11-06 22:02:19,857 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 7656 transitions. [2023-11-06 22:02:19,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 22:02:19,870 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:19,871 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] [2023-11-06 22:02:19,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:20,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-06 22:02:20,072 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:20,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1371214969, now seen corresponding path program 1 times [2023-11-06 22:02:20,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:20,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369274354] [2023-11-06 22:02:20,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:20,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:20,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:02:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:20,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:02:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:20,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:02:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:20,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:02:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:20,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:02:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:20,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:02:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:20,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:02:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:20,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-06 22:02:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:20,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:02:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:20,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:02:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:20,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:02:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-06 22:02:20,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:20,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369274354] [2023-11-06 22:02:20,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369274354] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:20,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924127414] [2023-11-06 22:02:20,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:20,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:20,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:20,371 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:20,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-11-06 22:02:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:20,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:02:20,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:02:20,702 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:20,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924127414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:20,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:02:20,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-11-06 22:02:20,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267755599] [2023-11-06 22:02:20,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:20,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:02:20,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:20,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:02:20,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:02:20,705 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) [2023-11-06 22:02:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:21,581 INFO L93 Difference]: Finished difference Result 11010 states and 14798 transitions. [2023-11-06 22:02:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:02:21,582 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 [2023-11-06 22:02:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:21,597 INFO L225 Difference]: With dead ends: 11010 [2023-11-06 22:02:21,597 INFO L226 Difference]: Without dead ends: 5656 [2023-11-06 22:02:21,606 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 [2023-11-06 22:02:21,606 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 202 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:21,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 160 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:02:21,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5656 states. [2023-11-06 22:02:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5656 to 5656. [2023-11-06 22:02:22,250 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) [2023-11-06 22:02:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 7624 transitions. [2023-11-06 22:02:22,270 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 7624 transitions. Word has length 133 [2023-11-06 22:02:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:22,271 INFO L495 AbstractCegarLoop]: Abstraction has 5656 states and 7624 transitions. [2023-11-06 22:02:22,271 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) [2023-11-06 22:02:22,271 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 7624 transitions. [2023-11-06 22:02:22,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-06 22:02:22,287 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:22,287 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] [2023-11-06 22:02:22,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:22,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-06 22:02:22,494 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:22,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:22,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1497129402, now seen corresponding path program 1 times [2023-11-06 22:02:22,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:22,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678711452] [2023-11-06 22:02:22,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:22,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:22,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:02:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:22,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:02:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:22,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:02:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:22,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:02:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:22,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:02:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:22,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:02:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:22,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:02:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:22,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:02:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:22,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-06 22:02:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:22,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-06 22:02:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:22,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-06 22:02:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:22,773 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-06 22:02:22,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:22,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678711452] [2023-11-06 22:02:22,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678711452] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:22,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002002412] [2023-11-06 22:02:22,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:22,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:22,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:22,775 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:22,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-11-06 22:02:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:22,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:02:22,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:02:23,110 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:23,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002002412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:23,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:02:23,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-11-06 22:02:23,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902528922] [2023-11-06 22:02:23,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:23,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:02:23,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:23,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:02:23,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:02:23,114 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) [2023-11-06 22:02:23,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:23,984 INFO L93 Difference]: Finished difference Result 10898 states and 14606 transitions. [2023-11-06 22:02:23,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:02:23,985 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 [2023-11-06 22:02:23,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:24,006 INFO L225 Difference]: With dead ends: 10898 [2023-11-06 22:02:24,006 INFO L226 Difference]: Without dead ends: 5544 [2023-11-06 22:02:24,018 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 [2023-11-06 22:02:24,019 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 274 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:24,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 144 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:02:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5544 states. [2023-11-06 22:02:24,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5544 to 5544. [2023-11-06 22:02:24,919 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) [2023-11-06 22:02:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7464 transitions. [2023-11-06 22:02:24,933 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7464 transitions. Word has length 134 [2023-11-06 22:02:24,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:24,934 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7464 transitions. [2023-11-06 22:02:24,934 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) [2023-11-06 22:02:24,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7464 transitions. [2023-11-06 22:02:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-06 22:02:24,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:24,945 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] [2023-11-06 22:02:24,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:25,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:25,145 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:25,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:25,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1907659227, now seen corresponding path program 1 times [2023-11-06 22:02:25,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:25,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477846542] [2023-11-06 22:02:25,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:25,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:25,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:02:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:25,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:02:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:25,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:02:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:25,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:02:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:25,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:02:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:25,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:02:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:25,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 22:02:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:25,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:02:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:25,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:02:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:25,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:02:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:25,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-06 22:02:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-06 22:02:25,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:25,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477846542] [2023-11-06 22:02:25,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477846542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:25,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:25,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:02:25,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914767066] [2023-11-06 22:02:25,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:25,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:02:25,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:25,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:02:25,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:02:25,355 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) [2023-11-06 22:02:26,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:26,786 INFO L93 Difference]: Finished difference Result 11218 states and 14990 transitions. [2023-11-06 22:02:26,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:02:26,787 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 [2023-11-06 22:02:26,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:26,810 INFO L225 Difference]: With dead ends: 11218 [2023-11-06 22:02:26,810 INFO L226 Difference]: Without dead ends: 5976 [2023-11-06 22:02:26,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:02:26,823 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 203 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:26,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 234 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:02:26,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2023-11-06 22:02:27,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 5656. [2023-11-06 22:02:27,544 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) [2023-11-06 22:02:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 7568 transitions. [2023-11-06 22:02:27,561 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 7568 transitions. Word has length 135 [2023-11-06 22:02:27,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:27,562 INFO L495 AbstractCegarLoop]: Abstraction has 5656 states and 7568 transitions. [2023-11-06 22:02:27,562 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) [2023-11-06 22:02:27,562 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 7568 transitions. [2023-11-06 22:02:27,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-06 22:02:27,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:27,574 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] [2023-11-06 22:02:27,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-06 22:02:27,575 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:27,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:27,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1853266329, now seen corresponding path program 1 times [2023-11-06 22:02:27,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:27,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648131863] [2023-11-06 22:02:27,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:27,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:27,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:02:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:27,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:02:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:27,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:02:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:27,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:02:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:27,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:02:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:27,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:02:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:27,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 22:02:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:27,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:02:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:27,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:02:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:27,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:02:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:27,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-06 22:02:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-06 22:02:27,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:27,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648131863] [2023-11-06 22:02:27,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648131863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:27,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:27,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:02:27,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638171912] [2023-11-06 22:02:27,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:27,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:02:27,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:27,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:02:27,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:02:27,805 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) [2023-11-06 22:02:29,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:29,692 INFO L93 Difference]: Finished difference Result 13294 states and 18642 transitions. [2023-11-06 22:02:29,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:02:29,692 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 [2023-11-06 22:02:29,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:29,711 INFO L225 Difference]: With dead ends: 13294 [2023-11-06 22:02:29,711 INFO L226 Difference]: Without dead ends: 7940 [2023-11-06 22:02:29,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:02:29,722 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 322 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:29,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 370 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:02:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7940 states. [2023-11-06 22:02:30,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7940 to 7204. [2023-11-06 22:02:30,594 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) [2023-11-06 22:02:30,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7204 states to 7204 states and 10192 transitions. [2023-11-06 22:02:30,615 INFO L78 Accepts]: Start accepts. Automaton has 7204 states and 10192 transitions. Word has length 135 [2023-11-06 22:02:30,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:30,616 INFO L495 AbstractCegarLoop]: Abstraction has 7204 states and 10192 transitions. [2023-11-06 22:02:30,616 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) [2023-11-06 22:02:30,616 INFO L276 IsEmpty]: Start isEmpty. Operand 7204 states and 10192 transitions. [2023-11-06 22:02:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-06 22:02:30,626 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:30,626 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] [2023-11-06 22:02:30,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-06 22:02:30,627 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:30,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1576268195, now seen corresponding path program 1 times [2023-11-06 22:02:30,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:30,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228768486] [2023-11-06 22:02:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:30,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:02:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:02:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:02:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:02:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:02:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:02:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 22:02:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-06 22:02:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:02:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 22:02:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-06 22:02:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-06 22:02:30,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:30,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228768486] [2023-11-06 22:02:30,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228768486] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:30,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207554504] [2023-11-06 22:02:30,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:30,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:30,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:30,845 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:30,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-11-06 22:02:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:02:30,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:31,155 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:02:31,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:02:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 22:02:31,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207554504] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:02:31,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:02:31,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2023-11-06 22:02:31,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012251000] [2023-11-06 22:02:31,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:02:31,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:02:31,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:31,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:02:31,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:02:31,425 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) [2023-11-06 22:02:35,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:35,318 INFO L93 Difference]: Finished difference Result 19309 states and 27520 transitions. [2023-11-06 22:02:35,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-06 22:02:35,318 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 [2023-11-06 22:02:35,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:35,355 INFO L225 Difference]: With dead ends: 19309 [2023-11-06 22:02:35,356 INFO L226 Difference]: Without dead ends: 12287 [2023-11-06 22:02:35,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=473, Invalid=1689, Unknown=0, NotChecked=0, Total=2162 [2023-11-06 22:02:35,374 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 1646 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1649 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:35,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1649 Valid, 398 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:02:35,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12287 states. [2023-11-06 22:02:36,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12287 to 11183. [2023-11-06 22:02:36,748 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) [2023-11-06 22:02:36,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11183 states to 11183 states and 14828 transitions. [2023-11-06 22:02:36,779 INFO L78 Accepts]: Start accepts. Automaton has 11183 states and 14828 transitions. Word has length 138 [2023-11-06 22:02:36,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:36,779 INFO L495 AbstractCegarLoop]: Abstraction has 11183 states and 14828 transitions. [2023-11-06 22:02:36,779 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) [2023-11-06 22:02:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 11183 states and 14828 transitions. [2023-11-06 22:02:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-06 22:02:36,789 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:36,789 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] [2023-11-06 22:02:36,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:36,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-11-06 22:02:36,990 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:36,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:36,990 INFO L85 PathProgramCache]: Analyzing trace with hash 700165149, now seen corresponding path program 1 times [2023-11-06 22:02:36,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:36,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214454615] [2023-11-06 22:02:36,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:36,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:02:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:02:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:02:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:02:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:02:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:02:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 22:02:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-06 22:02:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:02:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 22:02:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-06 22:02:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,262 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-06 22:02:37,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:37,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214454615] [2023-11-06 22:02:37,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214454615] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:37,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887171277] [2023-11-06 22:02:37,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:37,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:37,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:37,265 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:37,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-11-06 22:02:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:02:37,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:02:37,550 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:37,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887171277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:37,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:02:37,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-11-06 22:02:37,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485501810] [2023-11-06 22:02:37,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:37,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:02:37,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:37,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:02:37,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:02:37,553 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) [2023-11-06 22:02:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:38,159 INFO L93 Difference]: Finished difference Result 14412 states and 18889 transitions. [2023-11-06 22:02:38,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:02:38,160 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 [2023-11-06 22:02:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:38,162 INFO L225 Difference]: With dead ends: 14412 [2023-11-06 22:02:38,162 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:02:38,183 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 [2023-11-06 22:02:38,184 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 199 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:38,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 170 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:02:38,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:02:38,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:02:38,185 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) [2023-11-06 22:02:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:02:38,186 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2023-11-06 22:02:38,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:38,187 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:02:38,187 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) [2023-11-06 22:02:38,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:02:38,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:02:38,190 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:02:38,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:38,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:38,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:03:10,529 WARN L293 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 311 DAG size of output: 126 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-06 22:03:32,180 WARN L293 SmtUtils]: Spent 8.52s on a formula simplification. DAG size of input: 441 DAG size of output: 128 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-06 22:03:49,584 WARN L293 SmtUtils]: Spent 8.72s on a formula simplification. DAG size of input: 462 DAG size of output: 127 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-06 22:03:57,115 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 383 398) the Hoare annotation is: (let ((.cse0 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|)) (.cse1 (< ~b1_val_t~0 1)) (.cse2 (not (= ~z_val~0 0))) (.cse3 (< ~z_ev~0 2)) (.cse4 (< ~d1_val_t~0 1)) (.cse5 (< ~b0_val~0 ~b0_val_t~0)) (.cse6 (< ~b0_val_t~0 1)) (.cse7 (not (= 0 ~z_val_t~0))) (.cse8 (< ~d1_val~0 ~d1_val_t~0)) (.cse9 (< ~d0_val_t~0 1)) (.cse10 (< 0 ~comp_m1_i~0)) (.cse11 (< ~d0_val~0 ~d0_val_t~0)) (.cse12 (< ~b1_val~0 ~b1_val_t~0))) (and (or .cse0 (< ~b0_ev~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 (not (= ~b0_ev~0 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2023-11-06 22:03:57,115 INFO L895 garLoopResultBuilder]: At program point L129(lines 106 131) the Hoare annotation is: (let ((.cse13 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|)) (.cse15 (<= 1 |activate_threads_is_method1_triggered_~__retres1~0#1|))) (let ((.cse3 (and .cse13 .cse15)) (.cse14 (< ~b0_ev~0 2)) (.cse0 (< ~b1_val_t~0 1)) (.cse1 (not (= ~z_val~0 0))) (.cse2 (< ~z_ev~0 2)) (.cse4 (< ~d1_val_t~0 1)) (.cse5 (< ~b0_val~0 ~b0_val_t~0)) (.cse6 (< ~b0_val_t~0 1)) (.cse7 (not (= 0 ~z_val_t~0))) (.cse8 (< ~d1_val~0 ~d1_val_t~0)) (.cse9 (< ~d0_val_t~0 1)) (.cse10 (< 0 ~comp_m1_i~0)) (.cse11 (< ~d0_val~0 ~d0_val_t~0)) (.cse12 (< ~b1_val~0 ~b1_val_t~0))) (and (or .cse0 (not (= ~b0_ev~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse14 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse14 (not (= ~d1_ev~0 1)) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12) (or .cse14 .cse0 (not (= ~d0_ev~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse14 .cse0 (not (= ~b1_ev~0 1)) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12)))) [2023-11-06 22:03:57,116 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2023-11-06 22:03:57,116 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 125) no Hoare annotation was computed. [2023-11-06 22:03:57,116 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2023-11-06 22:03:57,116 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 127) no Hoare annotation was computed. [2023-11-06 22:03:57,116 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 383 398) no Hoare annotation was computed. [2023-11-06 22:03:57,117 INFO L895 garLoopResultBuilder]: At program point is_method1_triggered_returnLabel#1(lines 103 132) the Hoare annotation is: (let ((.cse15 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|)) (.cse0 (<= 1 |activate_threads_is_method1_triggered_#res#1|)) (.cse1 (<= 1 |activate_threads_is_method1_triggered_~__retres1~0#1|))) (let ((.cse2 (< ~b0_ev~0 2)) (.cse3 (< ~b1_val_t~0 1)) (.cse16 (and .cse15 .cse0 .cse1)) (.cse4 (not (= ~z_val~0 0))) (.cse5 (< ~z_ev~0 2)) (.cse6 (< ~d1_val_t~0 1)) (.cse7 (< ~b0_val~0 ~b0_val_t~0)) (.cse8 (< ~b0_val_t~0 1)) (.cse9 (not (= 0 ~z_val_t~0))) (.cse10 (< ~d1_val~0 ~d1_val_t~0)) (.cse11 (< ~d0_val_t~0 1)) (.cse12 (< 0 ~comp_m1_i~0)) (.cse13 (< ~d0_val~0 ~d0_val_t~0)) (.cse14 (< ~b1_val~0 ~b1_val_t~0))) (and (or (and .cse0 .cse1) .cse2 .cse3 (not (= ~b1_ev~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse2 (not (= ~d1_ev~0 1)) .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse3 (not (= ~b0_ev~0 1)) .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse2 .cse3 (not (= ~d0_ev~0 1)) .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2023-11-06 22:03:57,117 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2023-11-06 22:03:57,117 INFO L899 garLoopResultBuilder]: For program point L390-2(lines 383 398) no Hoare annotation was computed. [2023-11-06 22:03:57,118 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 264 278) no Hoare annotation was computed. [2023-11-06 22:03:57,118 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 273) no Hoare annotation was computed. [2023-11-06 22:03:57,118 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 264 278) the Hoare annotation is: true [2023-11-06 22:03:57,119 INFO L895 garLoopResultBuilder]: At program point L275(lines 267 277) the Hoare annotation is: (let ((.cse2 (< 0 ~d0_ev~0)) (.cse7 (< ~d1_ev~0 2)) (.cse11 (< ~b1_ev~0 2)) (.cse18 (< ~d0_ev~0 2)) (.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (< ~b0_ev~0 2)) (.cse20 (< 0 ~d1_ev~0)) (.cse3 (< ~b1_val_t~0 1)) (.cse19 (< 0 ~b1_ev~0)) (.cse4 (not (= ~z_val~0 0))) (.cse5 (< ~z_ev~0 2)) (.cse6 (< ~d1_val_t~0 1)) (.cse8 (< ~b0_val~0 ~b0_val_t~0)) (.cse9 (< ~b0_val_t~0 1)) (.cse10 (<= 1 exists_runnable_thread_~__retres1~1)) (.cse12 (not (= 0 ~z_val_t~0))) (.cse13 (< ~d1_val~0 ~d1_val_t~0)) (.cse14 (< ~d0_val_t~0 1)) (.cse15 (< 0 ~comp_m1_i~0)) (.cse16 (< ~d0_val~0 ~d0_val_t~0)) (.cse17 (< ~b1_val~0 ~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 .cse18 .cse0 .cse1 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse20 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse20 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse20 .cse3 .cse19 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-11-06 22:03:57,119 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 264 278) no Hoare annotation was computed. [2023-11-06 22:03:57,119 INFO L899 garLoopResultBuilder]: For program point L341-1(lines 317 349) no Hoare annotation was computed. [2023-11-06 22:03:57,119 INFO L899 garLoopResultBuilder]: For program point L331-1(lines 320 348) no Hoare annotation was computed. [2023-11-06 22:03:57,120 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(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 ((.cse2 (< |old(~b1_ev~0)| 2)) (.cse0 (not (= |old(~b0_ev~0)| 0))) (.cse10 (and .cse22 .cse23 .cse24 (= ~b0_ev~0 0) .cse25)) (.cse3 (< 0 |old(~d1_ev~0)|)) (.cse9 (< 0 |old(~d0_ev~0)|)) (.cse21 (< |old(~d0_ev~0)| 2)) (.cse1 (< ~b1_val_t~0 1)) (.cse17 (and .cse22 (= ~b0_ev~0 |old(~b0_ev~0)|) .cse23 .cse24 .cse25)) (.cse4 (not (= ~z_val~0 0))) (.cse5 (< ~d1_val_t~0 1)) (.cse6 (< ~b0_val~0 ~b0_val_t~0)) (.cse7 (< |old(~z_ev~0)| 2)) (.cse8 (< ~b0_val_t~0 1)) (.cse11 (not (= 0 ~z_val_t~0))) (.cse12 (< ~d1_val~0 ~d1_val_t~0)) (.cse13 (< ~d0_val_t~0 1)) (.cse14 (< 0 ~comp_m1_i~0)) (.cse20 (< 0 |old(~b1_ev~0)|)) (.cse15 (< ~d0_val~0 ~d0_val_t~0)) (.cse18 (< |old(~d1_ev~0)| 2)) (.cse19 (< |old(~b0_ev~0)| 2)) (.cse16 (< ~b1_val~0 ~b1_val_t~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse16) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse18 .cse16) (or .cse21 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse16) (or .cse21 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse16) (or .cse21 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse16) (or .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16) (or .cse21 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse16) (or .cse1 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse18 .cse19 .cse16) (or .cse21 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse16) (or .cse21 .cse1 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse19 .cse16) (or .cse21 .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse18 .cse16) (or .cse1 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse19 .cse16) (or .cse21 .cse1 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse18 .cse19 .cse16)))) [2023-11-06 22:03:57,121 INFO L899 garLoopResultBuilder]: For program point L321-1(lines 320 348) no Hoare annotation was computed. [2023-11-06 22:03:57,121 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 317 349) no Hoare annotation was computed. [2023-11-06 22:03:57,121 INFO L899 garLoopResultBuilder]: For program point L336-1(lines 320 348) no Hoare annotation was computed. [2023-11-06 22:03:57,121 INFO L899 garLoopResultBuilder]: For program point L326-1(lines 320 348) no Hoare annotation was computed. [2023-11-06 22:03:57,123 INFO L895 garLoopResultBuilder]: At program point update_z_returnLabel#1(lines 193 207) the Hoare annotation is: (let ((.cse47 (<= ~b1_ev~0 0)) (.cse57 (<= 2 ~d1_ev~0)) (.cse50 (= 0 ~z_val_t~0)) (.cse52 (<= 1 ~d0_val_t~0)) (.cse48 (<= ~comp_m1_i~0 0)) (.cse49 (<= 2 ~z_ev~0)) (.cse29 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse43 (<= ~d0_ev~0 0)) (.cse53 (<= 1 ~b0_val_t~0)) (.cse55 (<= 1 ~d1_val_t~0)) (.cse46 (= ~b0_ev~0 0)) (.cse51 (= |old(~z_val~0)| 0)) (.cse58 (<= 2 ~b1_ev~0)) (.cse30 (<= ~d0_val_t~0 ~d0_val~0)) (.cse44 (<= ~d1_ev~0 0)) (.cse45 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse31 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse32 (<= ~b1_val_t~0 ~b1_val~0)) (.cse56 (<= 2 ~d0_ev~0)) (.cse33 (<= ~b0_val_t~0 ~b0_val~0)) (.cse34 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse54 (<= 1 ~b1_val_t~0)) (.cse35 (= ~z_val~0 0)) (.cse36 (<= ~d1_val_t~0 ~d1_val~0)) (.cse37 (= |old(~b1_ev~0)| ~b1_ev~0))) (let ((.cse13 (and .cse51 .cse58 .cse30 .cse44 .cse45 .cse31 .cse32 .cse56 .cse33 .cse34 .cse54 .cse35 .cse36 .cse37)) (.cse21 (and .cse51 .cse58 .cse30 .cse44 .cse45 .cse32 .cse56 .cse33 .cse34 .cse54 .cse35 .cse36 .cse46 .cse37)) (.cse24 (and .cse48 .cse49 .cse51 .cse29 .cse58 .cse43 .cse30 .cse45 .cse53 .cse32 .cse33 .cse54 .cse35 .cse36 .cse55 .cse46 .cse37)) (.cse40 (and .cse48 .cse49 .cse50 .cse51 .cse29 .cse58 .cse43 .cse30 .cse45 .cse52 .cse31 .cse53 .cse32 .cse33 .cse54 .cse35 .cse36 .cse55 .cse37)) (.cse25 (and .cse48 .cse49 .cse50 .cse51 .cse29 .cse47 .cse30 .cse45 .cse52 .cse31 .cse53 .cse57 .cse32 .cse56 .cse33 .cse34 .cse54 .cse35 .cse36 .cse55)) (.cse27 (and .cse48 .cse49 .cse29 .cse47 .cse30 .cse45 .cse57 .cse32 .cse56 .cse33 .cse34 .cse35 .cse36 .cse46)) (.cse20 (and .cse51 .cse58 .cse43 .cse30 .cse44 .cse45 .cse31 .cse32 .cse33 .cse54 .cse35 .cse36 .cse55 .cse37)) (.cse22 (and .cse51 .cse58 .cse43 .cse30 .cse44 .cse45 .cse32 .cse33 .cse54 .cse35 .cse36 .cse55 .cse46 .cse37)) (.cse26 (and .cse48 .cse49 .cse51 .cse29 .cse47 .cse43 .cse30 .cse45 .cse53 .cse57 .cse32 .cse33 .cse54 .cse35 .cse36 .cse55 .cse46)) (.cse28 (and .cse48 .cse49 .cse50 .cse51 .cse29 .cse47 .cse43 .cse30 .cse45 .cse52 .cse31 .cse53 .cse57 .cse32 .cse33 .cse54 .cse35 .cse36 (<= 2 ~b0_ev~0) .cse55)) (.cse3 (< |old(~b1_ev~0)| 2)) (.cse38 (and .cse29 .cse30 .cse45 .cse32 .cse33 .cse34 .cse35 .cse36 .cse46 .cse37)) (.cse39 (< |old(~d1_ev~0)| 2)) (.cse41 (< 0 |old(~d0_ev~0)|)) (.cse0 (< |old(~d0_ev~0)| 2)) (.cse1 (and .cse49 .cse51 .cse47 .cse30 .cse44 .cse45 .cse31 .cse32 .cse56 .cse33 .cse34 .cse54 .cse35 .cse36)) (.cse2 (< ~b1_val_t~0 1)) (.cse4 (and .cse49 .cse50 .cse51 .cse47 .cse30 .cse44 .cse45 .cse52 .cse53 .cse32 .cse56 .cse33 .cse34 .cse54 .cse35 .cse36 .cse55 .cse46)) (.cse5 (not .cse51)) (.cse6 (< 0 |old(~d1_ev~0)|)) (.cse7 (< |old(~d0_val~0)| ~d0_val_t~0)) (.cse8 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse9 (< ~d1_val_t~0 1)) (.cse10 (< |old(~z_ev~0)| 2)) (.cse11 (< ~b0_val_t~0 1)) (.cse12 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse14 (and .cse48 .cse49 .cse50 .cse51 .cse47 .cse43 .cse30 .cse44 .cse45 .cse52 .cse53 .cse32 .cse33 .cse54 .cse35 .cse36 .cse55 .cse46)) (.cse15 (not .cse50)) (.cse16 (< ~d0_val_t~0 1)) (.cse17 (< 0 ~comp_m1_i~0)) (.cse18 (and .cse48 .cse49 .cse47 .cse43 .cse30 .cse44 .cse45 .cse31 .cse32 .cse33 .cse35 .cse36)) (.cse19 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse42 (< 0 |old(~b1_ev~0)|)) (.cse23 (< |old(~b0_ev~0)| 2))) (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 .cse24 .cse2 .cse3 .cse4 .cse5 .cse25 .cse26 .cse27 .cse28 .cse7 .cse8 .cse9 (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |old(~z_ev~0)| ~z_ev~0) .cse36 .cse37) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse38 .cse21 .cse39 .cse22 .cse40 .cse23) (or .cse24 .cse2 .cse3 .cse5 .cse26 .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse41 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse39 .cse22 .cse40 .cse23) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse25 .cse26 .cse27 .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse42 .cse39 .cse23) (or .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse41 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23) (or .cse2 .cse5 .cse26 .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse41 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse42 .cse39 .cse23) (or (not (= ~comp_m1_st~0 0)) .cse0 (and .cse43 .cse30 .cse44 .cse45 .cse32 .cse33 .cse35 .cse36 .cse46 .cse37) .cse2 (and .cse29 .cse43 .cse30 .cse45 .cse32 .cse33 .cse35 .cse36 .cse46 .cse37) .cse3 (not (= |old(~d0_req_up~0)| 1)) .cse5 .cse9 (not (= ~b0_val_t~0 1)) (and .cse29 .cse47 .cse43 .cse30 .cse45 .cse32 .cse33 .cse35 .cse36 .cse46) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (and .cse29 .cse47 .cse30 .cse45 .cse32 .cse33 .cse34 .cse35 .cse36 .cse46) (not (= |old(~b0_val~0)| 0)) (and .cse47 .cse43 .cse30 .cse44 .cse45 .cse32 .cse33 .cse35 .cse36 .cse46) .cse10 (and .cse47 .cse30 .cse44 .cse45 .cse32 .cse33 .cse34 .cse35 .cse36 .cse46) (not (= |old(~b1_req_up~0)| 1)) .cse15 .cse16 .cse17 .cse38 (and .cse30 .cse44 .cse45 .cse32 .cse33 .cse34 .cse35 .cse36 .cse46 .cse37) .cse39 .cse23) (or .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse41 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse42 .cse23) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse42 .cse23)))) [2023-11-06 22:03:57,123 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2023-11-06 22:03:57,123 INFO L899 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2023-11-06 22:03:57,124 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 211 249) no Hoare annotation was computed. [2023-11-06 22:03:57,124 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 157) no Hoare annotation was computed. [2023-11-06 22:03:57,124 INFO L899 garLoopResultBuilder]: For program point L152-2(lines 152 157) no Hoare annotation was computed. [2023-11-06 22:03:57,124 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 208 250) no Hoare annotation was computed. [2023-11-06 22:03:57,124 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 211 249) no Hoare annotation was computed. [2023-11-06 22:03:57,126 INFO L895 garLoopResultBuilder]: At program point update_b1_returnLabel#1(lines 148 162) the Hoare annotation is: (let ((.cse48 (<= 2 ~d1_ev~0)) (.cse57 (<= ~d1_ev~0 0)) (.cse50 (<= 2 ~d0_ev~0)) (.cse40 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse39 (= ~b0_ev~0 0)) (.cse43 (<= ~comp_m1_i~0 0)) (.cse44 (<= 2 ~z_ev~0)) (.cse42 (= 0 ~z_val_t~0)) (.cse45 (= |old(~z_val~0)| 0)) (.cse30 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse41 (<= ~b1_ev~0 0)) (.cse58 (<= ~d0_ev~0 0)) (.cse46 (<= ~d0_val_t~0 ~d0_val~0)) (.cse31 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse54 (<= 1 ~d0_val_t~0)) (.cse47 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse55 (<= 1 ~b0_val_t~0)) (.cse33 (<= ~b1_val_t~0 ~b1_val~0)) (.cse49 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse34 (<= ~b0_val_t~0 ~b0_val~0)) (.cse35 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse51 (<= 1 ~b1_val_t~0)) (.cse36 (= ~z_val~0 0)) (.cse52 (<= ~d1_val_t~0 ~d1_val~0)) (.cse38 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse56 (<= 1 ~d1_val_t~0)) (.cse53 (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (let ((.cse5 (and .cse43 .cse44 .cse42 .cse45 .cse30 .cse41 .cse58 .cse46 .cse31 .cse54 .cse47 .cse55 .cse33 .cse49 .cse34 .cse35 .cse51 .cse36 .cse52 .cse38 .cse56 .cse53)) (.cse15 (and .cse43 .cse44 .cse30 .cse41 .cse46 .cse31 .cse33 .cse49 .cse34 .cse35 .cse36 .cse52 .cse38 .cse39 .cse53)) (.cse22 (and .cse30 .cse46 .cse31 .cse33 .cse49 .cse34 .cse35 .cse36 .cse52 .cse38 .cse39 .cse40 .cse53)) (.cse25 (and .cse30 .cse41 .cse46 .cse31 .cse33 .cse49 .cse50 .cse34 .cse35 .cse36 .cse52 .cse38 .cse39 .cse53)) (.cse26 (and .cse45 .cse30 .cse41 .cse46 .cse31 .cse47 .cse33 .cse49 .cse50 .cse34 .cse35 .cse51 .cse36 .cse52 .cse38 .cse53)) (.cse28 (and .cse44 .cse45 .cse30 .cse41 .cse58 .cse46 .cse57 .cse31 .cse47 .cse55 .cse33 .cse49 .cse34 .cse35 .cse51 .cse36 .cse52 .cse38 .cse56 .cse53)) (.cse27 (< 0 |old(~d1_ev~0)|)) (.cse29 (and .cse44 .cse45 .cse30 .cse41 .cse46 .cse57 .cse31 .cse55 .cse33 .cse49 .cse34 .cse35 .cse51 .cse36 .cse52 .cse38 .cse56 .cse39 .cse53)) (.cse19 (and .cse44 .cse30 (<= 2 ~b1_ev~0) .cse46 .cse31 .cse33 .cse49 .cse34 .cse35 .cse36 .cse52 .cse38 .cse39 .cse40 .cse53)) (.cse9 (< 0 |old(~d0_ev~0)|)) (.cse20 (and .cse30 .cse46 .cse47 .cse33 .cse49 .cse34 .cse35 .cse36 (= |old(~z_ev~0)| ~z_ev~0) .cse52 .cse38 .cse40 .cse53)) (.cse18 (< |old(~b1_ev~0)| 2)) (.cse21 (< |old(~d0_ev~0)| 2)) (.cse0 (< ~b1_val_t~0 1)) (.cse1 (not .cse45)) (.cse2 (< |old(~d0_val~0)| ~d0_val_t~0)) (.cse3 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse4 (< ~d1_val_t~0 1)) (.cse23 (and .cse43 .cse44 .cse42 .cse45 .cse30 .cse41 .cse46 .cse31 .cse54 .cse55 .cse48 .cse33 .cse49 .cse50 .cse34 .cse35 .cse51 .cse36 .cse52 .cse38 .cse56 .cse39 .cse53)) (.cse6 (< |old(~z_ev~0)| 2)) (.cse7 (< ~b0_val_t~0 1)) (.cse8 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse24 (and .cse43 .cse44 .cse45 .cse30 .cse41 .cse46 .cse31 .cse47 .cse48 .cse33 .cse49 .cse50 .cse34 .cse35 .cse51 .cse36 .cse52 .cse38 .cse53)) (.cse10 (not .cse42)) (.cse11 (< ~d0_val_t~0 1)) (.cse12 (< 0 ~comp_m1_i~0)) (.cse13 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse14 (< 0 |old(~b1_ev~0)|)) (.cse16 (< |old(~d1_ev~0)| 2)) (.cse17 (< |old(~b0_ev~0)| 2))) (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 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (or .cse21 .cse22 .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse23 .cse6 .cse7 .cse8 .cse24 .cse20 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17) (or .cse21 .cse25 .cse22 .cse26 .cse0 .cse18 .cse1 .cse27 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse20 .cse10 .cse11 .cse12 .cse13 .cse17) (or .cse21 .cse25 .cse26 .cse0 .cse1 .cse27 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (or .cse0 .cse28 .cse1 .cse27 .cse2 .cse29 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (or .cse0 .cse28 .cse18 .cse1 .cse27 .cse2 .cse29 .cse3 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse17) (let ((.cse32 (= ~d0_req_up~0 1)) (.cse37 (= ~d1_req_up~0 1))) (or (not (= ~comp_m1_st~0 0)) .cse21 .cse0 .cse18 (not (= |old(~d0_req_up~0)| 1)) .cse1 (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse30 .cse41 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) .cse4 (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)) .cse6 (not (= |old(~b1_req_up~0)| 1)) .cse10 .cse11 .cse12 .cse16 .cse17)) (or .cse21 .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse6 .cse7 .cse8 .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17)))) [2023-11-06 22:03:57,126 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 187) no Hoare annotation was computed. [2023-11-06 22:03:57,126 INFO L899 garLoopResultBuilder]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2023-11-06 22:03:57,127 INFO L899 garLoopResultBuilder]: For program point L240-1(lines 208 250) no Hoare annotation was computed. [2023-11-06 22:03:57,128 INFO L895 garLoopResultBuilder]: At program point update_b0_returnLabel#1(lines 133 147) the Hoare annotation is: (let ((.cse21 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse26 (= ~b0_ev~0 0)) (.cse20 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse29 (<= ~d0_val_t~0 ~d0_val~0)) (.cse30 (<= ~b1_val_t~0 ~b1_val~0)) (.cse31 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse22 (<= ~b0_val_t~0 ~b0_val~0)) (.cse23 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse24 (= ~z_val~0 0)) (.cse32 (<= ~d1_val_t~0 ~d1_val~0)) (.cse33 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse25 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse27 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse34 (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (let ((.cse0 (< |old(~d0_ev~0)| 2)) (.cse2 (< |old(~b1_ev~0)| 2)) (.cse18 (< 0 |old(~d1_ev~0)|)) (.cse1 (< ~b1_val_t~0 1)) (.cse3 (not (= |old(~z_val~0)| 0))) (.cse4 (and .cse20 .cse29 (= ~b0_ev~0 |old(~b0_ev~0)|) .cse30 .cse31 .cse22 .cse23 .cse24 (= |old(~z_ev~0)| ~z_ev~0) .cse32 .cse33 .cse25 .cse27 .cse34)) (.cse5 (< |old(~d0_val~0)| ~d0_val_t~0)) (.cse6 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse7 (< ~d1_val_t~0 1)) (.cse8 (< |old(~z_ev~0)| 2)) (.cse9 (< ~b0_val_t~0 1)) (.cse10 (and .cse20 .cse29 .cse21 .cse30 .cse31 .cse22 .cse23 .cse24 .cse32 .cse33 .cse25 .cse26 .cse27 .cse34)) (.cse11 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse19 (< 0 |old(~d0_ev~0)|)) (.cse12 (not (= 0 ~z_val_t~0))) (.cse13 (< ~d0_val_t~0 1)) (.cse14 (< 0 ~comp_m1_i~0)) (.cse15 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse28 (< 0 |old(~b1_ev~0)|)) (.cse16 (< |old(~d1_ev~0)| 2)) (.cse17 (< |old(~b0_ev~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse17) (or (not (= ~comp_m1_st~0 0)) .cse0 (and .cse20 .cse21 (= ~d0_req_up~0 1) .cse22 .cse23 .cse24 (= ~d1_req_up~0 1) .cse25 .cse26 .cse27 (= 1 ~b1_req_up~0)) .cse1 .cse2 (not (= |old(~d0_req_up~0)| 1)) .cse3 .cse7 (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)) .cse8 (not (= |old(~b1_req_up~0)| 1)) .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse1 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse28 .cse17) (or .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17)))) [2023-11-06 22:03:57,129 INFO L895 garLoopResultBuilder]: At program point update_d1_returnLabel#1(lines 178 192) the Hoare annotation is: (let ((.cse55 (= 0 ~z_val_t~0)) (.cse53 (<= 1 ~b0_val_t~0)) (.cse50 (<= 2 ~b1_ev~0)) (.cse44 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse36 (<= ~d1_ev~0 0)) (.cse34 (<= ~d0_ev~0 0)) (.cse43 (= ~b0_ev~0 0)) (.cse56 (<= ~comp_m1_i~0 0)) (.cse49 (<= 2 ~z_ev~0)) (.cse51 (= |old(~z_val~0)| 0)) (.cse45 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse33 (<= ~b1_ev~0 0)) (.cse35 (<= ~d0_val_t~0 ~d0_val~0)) (.cse37 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse48 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse38 (<= ~b1_val_t~0 ~b1_val~0)) (.cse57 (<= 2 ~d0_ev~0)) (.cse39 (<= ~b0_val_t~0 ~b0_val~0)) (.cse47 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse52 (<= 1 ~b1_val_t~0)) (.cse40 (= ~z_val~0 0)) (.cse41 (<= ~d1_val_t~0 ~d1_val~0)) (.cse42 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse54 (<= 1 ~d1_val_t~0))) (let ((.cse10 (< 0 |old(~d0_ev~0)|)) (.cse16 (< 0 |old(~b1_ev~0)|)) (.cse23 (< 0 |old(~d1_ev~0)|)) (.cse20 (< |old(~d0_ev~0)| 2)) (.cse29 (and .cse56 .cse49 .cse51 .cse45 .cse33 .cse35 .cse37 .cse48 .cse38 .cse57 .cse39 .cse47 .cse52 .cse40 .cse41 .cse42 .cse54)) (.cse0 (< ~b1_val_t~0 1)) (.cse1 (and .cse49 .cse51 .cse45 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse52 .cse40 .cse41 .cse42 .cse54 .cse43)) (.cse21 (and .cse51 .cse33 .cse35 .cse36 .cse37 .cse38 .cse57 .cse39 .cse47 .cse52 .cse40 .cse41 .cse42 .cse43)) (.cse31 (and .cse51 .cse50 .cse35 .cse36 .cse37 .cse38 .cse57 .cse39 .cse47 .cse52 .cse40 .cse41 .cse42 .cse54 .cse43 .cse44)) (.cse24 (< |old(~b1_ev~0)| 2)) (.cse22 (and .cse33 .cse35 .cse36 .cse37 .cse48 .cse38 .cse57 .cse39 .cse47 .cse52 .cse40 .cse41 .cse42)) (.cse2 (not .cse51)) (.cse3 (< |old(~d0_val~0)| ~d0_val_t~0)) (.cse4 (and .cse51 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse52 .cse40 .cse41 .cse42 .cse54 .cse43)) (.cse5 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse6 (< ~d1_val_t~0 1)) (.cse46 (and .cse45 .cse35 .cse37 .cse38 .cse39 .cse47 .cse40 .cse41 .cse42 .cse43 .cse44)) (.cse7 (< |old(~z_ev~0)| 2)) (.cse8 (< ~b0_val_t~0 1)) (.cse9 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse25 (and .cse49 .cse51 .cse45 .cse50 .cse34 .cse35 .cse37 .cse48 .cse53 .cse38 .cse39 .cse52 .cse40 .cse41 .cse42 .cse54 .cse44)) (.cse32 (and .cse51 .cse50 .cse35 .cse36 .cse37 .cse48 .cse38 .cse57 .cse39 .cse47 .cse52 .cse40 .cse41 .cse42 .cse44)) (.cse30 (and .cse56 .cse49 .cse55 .cse51 .cse45 .cse33 .cse35 .cse37 (<= 1 ~d0_val_t~0) .cse53 .cse38 .cse57 .cse39 .cse47 .cse52 .cse40 .cse41 .cse42 .cse54 .cse43)) (.cse26 (and .cse49 .cse51 .cse50 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse52 .cse40 .cse41 .cse42 .cse54 .cse43 .cse44)) (.cse11 (not .cse55)) (.cse12 (< ~d0_val_t~0 1)) (.cse13 (< 0 ~comp_m1_i~0)) (.cse14 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse27 (and .cse49 .cse51 .cse50 .cse34 .cse35 .cse36 .cse37 .cse48 .cse53 .cse38 .cse39 .cse52 .cse40 .cse41 .cse42 .cse54 .cse44)) (.cse15 (and .cse49 .cse51 .cse45 .cse33 .cse34 .cse35 .cse37 .cse48 .cse53 .cse38 .cse39 .cse52 .cse40 .cse41 .cse42 .cse54)) (.cse17 (and .cse51 .cse33 .cse34 .cse35 .cse36 .cse37 .cse48 .cse38 .cse39 .cse52 .cse40 .cse41 .cse42)) (.cse18 (< |old(~d1_ev~0)| 2)) (.cse19 (< |old(~b0_ev~0)| 2)) (.cse28 (and .cse49 .cse45 .cse50 .cse34 .cse35 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse0 .cse21 .cse22 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse19) (or .cse0 .cse1 .cse24 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse25 .cse10 .cse26 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse17 .cse18 .cse19 .cse28) (or .cse20 .cse29 .cse0 .cse1 .cse21 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse30 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse24 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse14 .cse27 .cse17 .cse19) (or .cse0 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse19) (or .cse20 .cse0 .cse21 .cse31 .cse24 .cse22 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse32 .cse26 .cse11 .cse12 .cse13 .cse14 .cse27 .cse17 .cse19) (or (not (= ~comp_m1_st~0 0)) .cse20 (and .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43) .cse0 .cse24 (not (= |old(~d0_req_up~0)| 1)) .cse2 (and .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse45 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43) (and .cse45 .cse34 .cse35 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44) .cse6 .cse46 (and .cse35 .cse36 .cse37 .cse38 .cse39 .cse47 .cse40 .cse41 .cse42 .cse43 .cse44) (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)) .cse7 (and .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse47 .cse40 .cse41 .cse42 .cse43) (and .cse45 .cse33 .cse35 .cse37 .cse38 .cse39 .cse47 .cse40 .cse41 .cse42 .cse43) (not (= |old(~b1_req_up~0)| 1)) .cse11 .cse12 .cse13 .cse18 .cse19) (or .cse20 .cse29 .cse0 .cse1 .cse21 .cse31 (and .cse45 .cse35 .cse48 .cse38 .cse39 .cse47 .cse40 (= |old(~z_ev~0)| ~z_ev~0) .cse41 .cse42 .cse44) .cse24 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse46 .cse7 .cse8 .cse9 .cse25 .cse32 .cse30 .cse26 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse17 .cse18 .cse19 .cse28)))) [2023-11-06 22:03:57,131 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(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_ev~0 |old(~b0_ev~0)|)) (.cse23 (= ~b1_val~0 |old(~b1_val~0)|)) (.cse24 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse25 (= ~z_val~0 0)) (.cse26 (= |old(~z_ev~0)| ~z_ev~0)) (.cse27 (= |old(~d0_val~0)| ~d0_val~0)) (.cse28 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse29 (= |old(~b1_ev~0)| ~b1_ev~0))) (let ((.cse18 (< 0 |old(~b1_ev~0)|)) (.cse5 (< 0 |old(~d1_ev~0)|)) (.cse17 (< 0 |old(~d0_ev~0)|)) (.cse0 (< |old(~d0_ev~0)| 2)) (.cse1 (and .cse20 .cse21 (= ~b0_req_up~0 |old(~b0_req_up~0)|) .cse22 .cse23 (= |old(~d0_req_up~0)| ~d0_req_up~0) .cse24 .cse25 .cse26 .cse27 (= |old(~b1_req_up~0)| ~b1_req_up~0) .cse28 .cse29 (= |old(~b0_val~0)| ~b0_val~0) (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (.cse2 (< ~b1_val_t~0 1)) (.cse3 (< |old(~b1_ev~0)| 2)) (.cse4 (not (= |old(~z_val~0)| 0))) (.cse6 (< |old(~d0_val~0)| ~d0_val_t~0)) (.cse7 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse8 (< ~d1_val_t~0 1)) (.cse9 (< |old(~z_ev~0)| 2)) (.cse10 (< ~b0_val_t~0 1)) (.cse11 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse12 (not (= 0 ~z_val_t~0))) (.cse13 (< ~d0_val_t~0 1)) (.cse14 (< 0 ~comp_m1_i~0)) (.cse15 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse19 (< |old(~d1_ev~0)| 2)) (.cse16 (< |old(~b0_ev~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse16) (or (not (= ~comp_m1_st~0 0)) .cse0 (and (= ~b0_req_up~0 1) .cse20 .cse21 .cse22 (= ~d0_req_up~0 1) .cse23 (= ~b0_val~0 0) .cse24 .cse25 .cse26 .cse27 (= ~d1_req_up~0 1) .cse28 .cse29 (= 1 ~b1_req_up~0)) .cse2 .cse3 (not (= |old(~d0_req_up~0)| 1)) .cse4 .cse8 (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)) .cse9 (not (= |old(~b1_req_up~0)| 1)) .cse12 .cse13 .cse14 .cse19 .cse16) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse18 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse16) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16)))) [2023-11-06 22:03:57,131 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 142) no Hoare annotation was computed. [2023-11-06 22:03:57,131 INFO L899 garLoopResultBuilder]: For program point L137-2(lines 137 142) no Hoare annotation was computed. [2023-11-06 22:03:57,131 INFO L899 garLoopResultBuilder]: For program point L212-1(lines 211 249) no Hoare annotation was computed. [2023-11-06 22:03:57,133 INFO L895 garLoopResultBuilder]: At program point update_d0_returnLabel#1(lines 163 177) the Hoare annotation is: (let ((.cse52 (<= ~d1_ev~0 0)) (.cse12 (= ~b0_ev~0 0)) (.cse3 (<= ~b1_ev~0 0)) (.cse59 (<= 2 ~d1_ev~0)) (.cse54 (<= 2 ~d0_ev~0)) (.cse15 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse45 (<= ~comp_m1_i~0 0)) (.cse46 (<= 2 ~z_ev~0)) (.cse50 (= 0 ~z_val_t~0)) (.cse51 (= |old(~z_val~0)| 0)) (.cse2 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse47 (<= 2 ~b1_ev~0)) (.cse4 (<= ~d0_ev~0 0)) (.cse5 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse56 (<= 1 ~d0_val_t~0)) (.cse53 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse57 (<= 1 ~b0_val_t~0)) (.cse7 (<= ~b1_val_t~0 ~b1_val~0)) (.cse8 (<= ~b0_val_t~0 ~b0_val~0)) (.cse55 (<= 1 ~b1_val_t~0)) (.cse9 (= ~z_val~0 0)) (.cse48 (<= ~d1_val_t~0 ~d1_val~0)) (.cse11 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse58 (<= 1 ~d1_val_t~0)) (.cse16 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse49 (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (let ((.cse25 (and .cse45 .cse46 .cse50 .cse51 .cse2 .cse47 .cse4 .cse5 .cse6 .cse56 .cse53 .cse57 .cse7 .cse8 .cse55 .cse9 .cse48 .cse11 .cse58 .cse16 .cse49)) (.cse29 (and .cse45 .cse46 .cse51 .cse2 .cse3 .cse5 .cse6 .cse53 .cse59 .cse7 .cse54 .cse8 .cse15 .cse55 .cse9 .cse48 .cse11 .cse49)) (.cse36 (and .cse45 .cse46 .cse50 .cse51 .cse2 .cse3 .cse5 .cse6 .cse56 .cse57 .cse59 .cse7 .cse54 .cse8 .cse15 .cse55 .cse9 .cse48 .cse11 .cse58 .cse12 .cse49)) (.cse26 (and .cse46 .cse51 .cse2 .cse3 .cse4 .cse5 .cse6 .cse57 .cse7 .cse8 .cse55 .cse9 .cse48 .cse11 .cse58 .cse12 .cse49)) (.cse34 (and .cse46 .cse51 .cse2 .cse3 .cse4 .cse5 .cse6 .cse53 .cse7 .cse8 .cse55 .cse9 .cse48 .cse11 .cse58 .cse49)) (.cse22 (< |old(~d1_ev~0)| 2)) (.cse37 (< 0 |old(~d0_ev~0)|)) (.cse43 (< 0 |old(~b1_ev~0)|)) (.cse0 (< |old(~d0_ev~0)| 2)) (.cse38 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse48 .cse11 .cse12 .cse49)) (.cse24 (and .cse2 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse48 .cse11 .cse12 .cse16 .cse49)) (.cse39 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse53 .cse7 .cse8 .cse55 .cse9 .cse48 .cse11 .cse49)) (.cse1 (< ~b1_val_t~0 1)) (.cse13 (< |old(~b1_ev~0)| 2)) (.cse14 (not .cse51)) (.cse40 (< 0 |old(~d1_ev~0)|)) (.cse27 (< |old(~d0_val~0)| ~d0_val_t~0)) (.cse28 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse17 (< ~d1_val_t~0 1)) (.cse41 (and .cse45 .cse46 .cse50 .cse51 .cse2 .cse3 .cse5 .cse52 .cse6 .cse56 .cse57 .cse7 .cse54 .cse8 .cse15 .cse55 .cse9 .cse48 .cse11 .cse58 .cse12 .cse49)) (.cse18 (< |old(~z_ev~0)| 2)) (.cse30 (< ~b0_val_t~0 1)) (.cse44 (and .cse45 .cse46 .cse2 .cse47 .cse4 .cse5 .cse6 .cse53 .cse7 .cse8 .cse55 .cse9 .cse48 .cse11 .cse16 .cse49)) (.cse31 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse32 (and .cse2 .cse5 .cse53 .cse7 .cse8 .cse15 .cse9 (= |old(~z_ev~0)| ~z_ev~0) .cse48 .cse11 .cse16 .cse49)) (.cse42 (and .cse45 .cse46 .cse51 .cse2 .cse3 .cse5 .cse52 .cse6 .cse53 .cse7 .cse54 .cse8 .cse15 .cse55 .cse9 .cse48 .cse11 .cse49)) (.cse19 (not .cse50)) (.cse20 (< ~d0_val_t~0 1)) (.cse21 (< 0 ~comp_m1_i~0)) (.cse33 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse35 (and .cse45 .cse46 .cse2 .cse47 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse48 .cse11 .cse12 .cse16 .cse49)) (.cse23 (< |old(~b0_ev~0)| 2))) (and (let ((.cse10 (= ~d1_req_up~0 1))) (or (not (= ~comp_m1_st~0 0)) .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 (not (= |old(~d0_req_up~0)| 1)) .cse14 (and .cse2 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12) .cse17 (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)) .cse18 (and .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (not (= |old(~b1_req_up~0)| 1)) .cse19 .cse20 .cse21 .cse22 .cse23)) (or .cse0 .cse24 .cse25 .cse1 .cse26 .cse13 .cse14 .cse27 .cse28 .cse17 .cse29 .cse18 .cse30 .cse31 .cse32 .cse19 .cse20 .cse21 .cse33 .cse34 .cse22 .cse35 .cse36 .cse23) (or .cse25 .cse1 .cse26 .cse13 .cse14 .cse27 .cse28 .cse17 .cse18 .cse30 .cse31 .cse37 .cse19 .cse20 .cse21 .cse33 .cse34 .cse22 .cse35 .cse23) (or .cse0 .cse38 .cse39 .cse1 .cse14 .cse40 .cse27 .cse28 .cse17 .cse41 .cse18 .cse30 .cse31 .cse42 .cse19 .cse20 .cse21 .cse33 .cse43 .cse23) (or .cse38 .cse39 .cse1 .cse13 .cse14 .cse40 .cse27 .cse28 .cse17 .cse18 .cse30 .cse44 .cse31 .cse37 .cse19 .cse20 .cse21 .cse33 .cse35 .cse23) (or .cse0 .cse1 .cse26 .cse14 .cse27 .cse28 .cse17 .cse29 .cse18 .cse30 .cse31 .cse19 .cse20 .cse21 .cse33 .cse34 .cse43 .cse22 .cse36 .cse23) (or .cse1 .cse26 .cse14 .cse27 .cse28 .cse17 .cse18 .cse30 .cse31 .cse37 .cse19 .cse20 .cse21 .cse33 .cse34 .cse43 .cse22 .cse23) (or .cse38 .cse39 .cse1 .cse14 .cse40 .cse27 .cse28 .cse17 .cse18 .cse30 .cse31 .cse37 .cse19 .cse20 .cse21 .cse33 .cse43 .cse23) (or .cse0 .cse38 .cse24 .cse39 .cse1 .cse13 .cse14 .cse40 .cse27 .cse28 .cse17 .cse41 .cse18 .cse30 .cse44 .cse31 .cse32 .cse42 .cse19 .cse20 .cse21 .cse33 .cse35 .cse23)))) [2023-11-06 22:03:57,133 INFO L899 garLoopResultBuilder]: For program point L233-1(lines 211 249) no Hoare annotation was computed. [2023-11-06 22:03:57,134 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2023-11-06 22:03:57,134 INFO L899 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2023-11-06 22:03:57,134 INFO L899 garLoopResultBuilder]: For program point L374-1(lines 350 382) no Hoare annotation was computed. [2023-11-06 22:03:57,134 INFO L899 garLoopResultBuilder]: For program point L364-1(lines 353 381) no Hoare annotation was computed. [2023-11-06 22:03:57,135 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 350 382) the Hoare annotation is: (let ((.cse20 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse24 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse21 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse22 (= |old(~z_ev~0)| ~z_ev~0)) (.cse23 (= |old(~b1_ev~0)| ~b1_ev~0))) (let ((.cse1 (< |old(~b1_ev~0)| 2)) (.cse18 (< 0 |old(~d1_ev~0)|)) (.cse8 (< 0 |old(~d0_ev~0)|)) (.cse17 (< |old(~d0_ev~0)| 2)) (.cse2 (and .cse20 .cse24 .cse21 .cse22 .cse23)) (.cse25 (< 0 |old(~b1_ev~0)|)) (.cse14 (< |old(~d1_ev~0)| 2)) (.cse19 (not (= ~comp_m1_st~0 0))) (.cse0 (< ~b1_val_t~0 1)) (.cse3 (not (= ~z_val~0 0))) (.cse4 (< ~d1_val_t~0 1)) (.cse5 (< ~b0_val~0 ~b0_val_t~0)) (.cse6 (< |old(~z_ev~0)| 2)) (.cse7 (< ~b0_val_t~0 1)) (.cse9 (not (= 0 ~z_val_t~0))) (.cse10 (< ~d1_val~0 ~d1_val_t~0)) (.cse11 (< ~d0_val_t~0 1)) (.cse12 (< 0 ~comp_m1_i~0)) (.cse13 (< ~d0_val~0 ~d0_val_t~0)) (.cse15 (< |old(~b0_ev~0)| 2)) (.cse16 (< ~b1_val~0 ~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 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (or .cse19 .cse0 .cse3 .cse4 .cse5 (and .cse20 (= ~b0_ev~0 1) .cse21 .cse22 .cse23) .cse6 .cse7 (not (= |old(~b0_ev~0)| 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse16) (or .cse19 (not (= |old(~b1_ev~0)| 1)) .cse0 .cse3 .cse4 .cse5 .cse6 (and .cse20 .cse24 (= ~b1_ev~0 1) .cse21 .cse22) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (or .cse19 (not (= |old(~d0_ev~0)| 1)) .cse0 (and .cse20 .cse24 (= ~d0_ev~0 1) .cse22 .cse23) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse15 .cse16) (or .cse0 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse15 .cse16) (or .cse17 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16) (or .cse19 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= |old(~d1_ev~0)| 1)) .cse15 (and .cse24 .cse21 .cse22 (= ~d1_ev~0 1) .cse23) .cse16)))) [2023-11-06 22:03:57,135 INFO L899 garLoopResultBuilder]: For program point L354-1(lines 353 381) no Hoare annotation was computed. [2023-11-06 22:03:57,136 INFO L899 garLoopResultBuilder]: For program point L369-1(lines 353 381) no Hoare annotation was computed. [2023-11-06 22:03:57,136 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 350 382) no Hoare annotation was computed. [2023-11-06 22:03:57,136 INFO L899 garLoopResultBuilder]: For program point L359-1(lines 353 381) no Hoare annotation was computed. [2023-11-06 22:03:57,137 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 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 (<= 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 .cse17 .cse4 .cse5 .cse6 .cse7 .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 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-11-06 22:03:57,137 INFO L899 garLoopResultBuilder]: For program point L440-1(line 440) no Hoare annotation was computed. [2023-11-06 22:03:57,137 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2023-11-06 22:03:57,137 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2023-11-06 22:03:57,137 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 51 101) no Hoare annotation was computed. [2023-11-06 22:03:57,137 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:03:57,138 INFO L895 garLoopResultBuilder]: At program point L432-1(lines 432 454) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 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 (<= 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 .cse17 .cse4 .cse5 .cse6 .cse7 .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 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-11-06 22:03:57,138 INFO L895 garLoopResultBuilder]: At program point method1_returnLabel#1(lines 46 102) the Hoare annotation is: (let ((.cse5 (<= ~d1_ev~0 0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse17 (<= 2 ~b1_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (<= ~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)) (.cse19 (<= 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 (= ~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 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse19 .cse8 .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 .cse17 .cse18 .cse4 .cse6 .cse7 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-06 22:03:57,139 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 493 511) the Hoare annotation is: true [2023-11-06 22:03:57,139 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2023-11-06 22:03:57,139 INFO L899 garLoopResultBuilder]: For program point L61(lines 51 101) no Hoare annotation was computed. [2023-11-06 22:03:57,139 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:03:57,139 INFO L895 garLoopResultBuilder]: At program point start_simulation_returnLabel#1(lines 418 460) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (= 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)) [2023-11-06 22:03:57,140 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2023-11-06 22:03:57,140 INFO L899 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2023-11-06 22:03:57,140 INFO L895 garLoopResultBuilder]: At program point L425(line 425) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (<= 2 ~z_ev~0) (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (= ~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)) [2023-11-06 22:03:57,140 INFO L899 garLoopResultBuilder]: For program point L425-1(line 425) no Hoare annotation was computed. [2023-11-06 22:03:57,140 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2023-11-06 22:03:57,141 INFO L899 garLoopResultBuilder]: For program point L79(lines 51 101) no Hoare annotation was computed. [2023-11-06 22:03:57,141 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:03:57,141 INFO L895 garLoopResultBuilder]: At program point error_returnLabel#1(lines 15 22) the Hoare annotation is: false [2023-11-06 22:03:57,141 INFO L895 garLoopResultBuilder]: At program point L286(line 286) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 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 (<= 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 .cse17 .cse4 .cse5 .cse6 .cse7 .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 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-11-06 22:03:57,142 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 507) no Hoare annotation was computed. [2023-11-06 22:03:57,142 INFO L899 garLoopResultBuilder]: For program point L501-2(lines 501 507) no Hoare annotation was computed. [2023-11-06 22:03:57,142 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 84) no Hoare annotation was computed. [2023-11-06 22:03:57,142 INFO L895 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse3 (<= ~b1_ev~0 0)) (.cse7 (<= 2 ~d1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~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 (<= 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 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .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 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .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 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-11-06 22:03:57,143 INFO L895 garLoopResultBuilder]: At program point L427-1(line 427) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (<= 2 ~z_ev~0) (= 0 ~z_val_t~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)) [2023-11-06 22:03:57,143 INFO L895 garLoopResultBuilder]: At program point L295(lines 285 310) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 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 (<= 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 .cse17 .cse4 .cse5 .cse6 .cse7 .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 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-11-06 22:03:57,144 INFO L895 garLoopResultBuilder]: At program point eval_returnLabel#1(lines 279 316) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 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 (<= 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 .cse17 .cse4 .cse5 .cse6 .cse7 .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 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-11-06 22:03:57,144 INFO L895 garLoopResultBuilder]: At program point L444(line 444) the Hoare annotation is: (let ((.cse3 (<= ~b1_ev~0 0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse7 (<= 2 ~d1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse19 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~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 (<= 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 .cse16 .cse17 .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 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .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 .cse16 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse19 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse19 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-11-06 22:03:57,144 INFO L895 garLoopResultBuilder]: At program point L444-1(line 444) the Hoare annotation is: (let ((.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~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))) [2023-11-06 22:03:57,145 INFO L895 garLoopResultBuilder]: At program point L428(line 428) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (<= 2 ~z_ev~0) (= 0 ~z_val_t~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)) [2023-11-06 22:03:57,145 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2023-11-06 22:03:57,145 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 51 101) no Hoare annotation was computed. [2023-11-06 22:03:57,145 INFO L899 garLoopResultBuilder]: For program point L288(line 288) no Hoare annotation was computed. [2023-11-06 22:03:57,146 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:03:57,146 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2023-11-06 22:03:57,146 INFO L895 garLoopResultBuilder]: At program point L255-2(lines 251 263) the Hoare annotation is: (let ((.cse3 (<= ~b1_ev~0 0)) (.cse7 (<= 2 ~d1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~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 (<= 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 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .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 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .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 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-11-06 22:03:57,147 INFO L895 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse18 (= ~comp_m1_st~0 0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse19 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 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 (<= 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 .cse17 .cse4 .cse5 .cse6 .cse7 .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 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 (= ~b0_ev~0 1) .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse19 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-11-06 22:03:57,147 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:03:57,147 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:03:57,147 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2023-11-06 22:03:57,147 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2023-11-06 22:03:57,148 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 88 96) no Hoare annotation was computed. [2023-11-06 22:03:57,148 INFO L895 garLoopResultBuilder]: At program point L405(line 405) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 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 (<= 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 .cse17 .cse4 .cse5 .cse6 .cse7 .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 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-11-06 22:03:57,148 INFO L899 garLoopResultBuilder]: For program point L405-1(line 405) no Hoare annotation was computed. [2023-11-06 22:03:57,148 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2023-11-06 22:03:57,149 INFO L899 garLoopResultBuilder]: For program point L290-1(lines 285 310) no Hoare annotation was computed. [2023-11-06 22:03:57,149 INFO L895 garLoopResultBuilder]: At program point init_model_returnLabel#1(lines 461 492) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (<= 2 ~z_ev~0) (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (= ~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)) [2023-11-06 22:03:57,149 INFO L895 garLoopResultBuilder]: At program point L414(lines 403 416) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 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 (<= 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 .cse17 .cse4 .cse5 .cse6 .cse7 .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 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-11-06 22:03:57,150 INFO L895 garLoopResultBuilder]: At program point stop_simulation_returnLabel#1(lines 399 417) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 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 (<= 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 .cse17 .cse4 .cse5 .cse6 .cse7 .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 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-11-06 22:03:57,150 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 306) no Hoare annotation was computed. [2023-11-06 22:03:57,154 INFO L445 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] [2023-11-06 22:03:57,157 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:03:57,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:03:57 BoogieIcfgContainer [2023-11-06 22:03:57,491 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:03:57,492 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:03:57,492 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:03:57,492 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:03:57,493 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:01:16" (3/4) ... [2023-11-06 22:03:57,495 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:03:57,501 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2023-11-06 22:03:57,501 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2023-11-06 22:03:57,501 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2023-11-06 22:03:57,502 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2023-11-06 22:03:57,502 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2023-11-06 22:03:57,519 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-06 22:03:57,520 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:03:57,521 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:03:57,522 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:03:57,562 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || ((((((((((((((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(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2)) && ((((((((((((((((((b1_val_t < 1) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || ((((((((((((((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)))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(b0_ev) < 2))) && ((((((((((((((((((!((comp_m1_st == 0)) || (\old(d0_ev) < 2)) || (((((((((((d1_ev == \old(d1_ev)) && (\old(z_ev) <= z_ev)) && (d0_req_up == 1)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (1 == b1_req_up))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(d0_req_up) == 1))) || !((\old(z_val) == 0))) || (d1_val_t < 1)) || !((b0_val_t == 1))) || !((\old(b0_req_up) == 1))) || !((\old(d1_req_up) == 1))) || !((\old(b0_val) == 0))) || (\old(z_ev) < 2)) || !((\old(b1_req_up) == 1))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || !((\old(z_val) == 0))) || ((((((((((((((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)))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || !((\old(z_val) == 0))) || ((((((((((((((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(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || ((((((((((((((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)))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || ((((((((((((((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(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || !((\old(z_val) == 0))) || ((((((((((((((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)))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || !((\old(z_val) == 0))) || ((((((((((((((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(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) [2023-11-06 22:03:57,562 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((b1_val_t < 1) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || ((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (1 <= d0_val_t)) && (b0_ev == \old(b0_ev))) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (\old(d0_req_up) == d0_req_up)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2)) && ((((((((((((((((((((b1_val_t < 1) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (((((((((((((((2 <= z_ev) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || ((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (1 <= d0_val_t)) && (b0_ev == \old(b0_ev))) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (\old(d0_req_up) == d0_req_up)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || (((((((((((((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)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((((\old(d0_ev) < 2) || (((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (\old(d0_req_up) == d0_req_up)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (2 <= d1_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (((((((((((((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)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || ((((((((((((((((\old(z_val) == 0) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (((((((((((((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)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(b0_ev) < 2))) && ((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || ((((((((((((((((\old(z_val) == 0) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || ((((((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_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))) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (\old(d0_req_up) == d0_req_up)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (((((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (\old(d0_req_up) == d0_req_up)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((b1_val_t < 1) || ((((((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_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))) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (\old(d0_req_up) == d0_req_up)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (((((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (\old(d0_req_up) == d0_req_up)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (((((((((((((((2 <= z_ev) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || (((((((((((((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)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(b0_ev) < 2))) && (((((((((((((((((((!((comp_m1_st == 0)) || (\old(d0_ev) < 2)) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(d0_req_up) == 1))) || !((\old(z_val) == 0))) || (((((((((((d1_ev == \old(d1_ev)) && (\old(z_ev) <= z_ev)) && (d0_req_up == 1)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (d0_req_up == 1)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (d1_val_t < 1)) || !((b0_val_t == 1))) || !((\old(b0_req_up) == 1))) || !((\old(d1_req_up) == 1))) || !((\old(b0_val) == 0))) || (\old(z_ev) < 2)) || !((\old(b1_req_up) == 1))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (\old(d0_req_up) == d0_req_up)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (2 <= d1_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) [2023-11-06 22:03:57,564 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((!((comp_m1_st == 0)) || (\old(d0_ev) < 2)) || (b1_val_t < 1)) || (((((((((((d1_ev == \old(d1_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_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (\old(b1_ev) < 2)) || !((\old(d0_req_up) == 1))) || !((\old(z_val) == 0))) || (((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (d1_val_t < 1)) || !((b0_val_t == 1))) || !((\old(b0_req_up) == 1))) || !((\old(d1_req_up) == 1))) || !((\old(b0_val) == 0))) || (\old(z_ev) < 2)) || (((((((((((d1_ev == \old(d1_ev)) && (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_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || !((\old(b1_req_up) == 1))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2)) && ((((((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < 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)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (\old(d1_ev) < 2)) || (((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || ((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up))) || (b1_val_t < 1)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (\old(d1_ev) < 2)) || (((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((d1_ev == \old(d1_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (((((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || ((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && (((((((((((((((((((((((((((((((d1_ev == \old(d1_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up))) || (((((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || ((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && (((((((((((((((((((((((((((((d1_ev == \old(d1_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up))) || (((((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((d1_ev == \old(d1_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || ((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (((((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || ((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < 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) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_ev) < 2))) [2023-11-06 22:03:57,565 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((b1_val_t < 1) || (((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_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)) && (1 <= b1_val_t)) && (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))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t))) || (0 < \old(b1_ev))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2)) && ((((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || ((((((((((((((\old(z_val) == 0) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (((((((((((((b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((b1_val_t < 1) || (((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (0 < \old(d0_ev))) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2)) || (((((((((((((2 <= z_ev) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)))) && ((((((((((((((((((((((((\old(d0_ev) < 2) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t))) || (b1_val_t < 1)) || (((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_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)) && (1 <= b1_val_t)) && (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) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (((((((((((((b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t))) || (0 < \old(b1_ev))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((((b1_val_t < 1) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || ((((((((((((((\old(z_val) == 0) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || ((((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (\old(b1_ev) < 2)) || (((((((((((((b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(b0_ev) < 2))) && (((((((((((((((((((((((((!((comp_m1_st == 0)) || (\old(d0_ev) < 2)) || (((((((((((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))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(d0_req_up) == 1))) || !((\old(z_val) == 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)) && (\old(b1_ev) == b1_ev))) || (((((((((((d1_ev == \old(d1_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (((((((((((d1_ev == \old(d1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (d1_val_t < 1)) || (((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev))) || (((((((((((d0_val_t <= d0_val) && (d1_ev <= 0)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev))) || !((b0_val_t == 1))) || !((\old(b0_req_up) == 1))) || !((\old(d1_req_up) == 1))) || !((\old(b0_val) == 0))) || (\old(z_ev) < 2)) || (((((((((((b1_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)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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))) || !((\old(b1_req_up) == 1))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((((((((((\old(d0_ev) < 2) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t))) || (b1_val_t < 1)) || (((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_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)) && (1 <= b1_val_t)) && (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) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || ((((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (((((((((((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(b1_ev) < 2)) || (((((((((((((b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2)) || (((((((((((((2 <= z_ev) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)))) [2023-11-06 22:03:57,566 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || ((((((((((((((((((2 <= z_ev) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (\old(b0_ev) < 2)) && ((((((((((((((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val))) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (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)) && (\old(b1_ev) == b1_ev))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || ((((((((((((((((((2 <= z_ev) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((\old(z_val) == 0))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || ((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (2 <= d1_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)) && (b0_ev == 0))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || ((((((((((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(b1_ev) == b1_ev))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || ((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (\old(d1_ev) < 2)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (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)) && (\old(b1_ev) == b1_ev)) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (\old(d1_ev) < 2)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val))) || (b1_val_t < 1)) || ((((((((((((((((((2 <= z_ev) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((\old(z_val) == 0))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || ((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (2 <= d1_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)) && (b0_ev == 0))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((((b1_val_t < 1) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((b1_val_t < 1) || !((\old(z_val) == 0))) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && (((((((((((((((((((((((((!((comp_m1_st == 0)) || (\old(d0_ev) < 2)) || ((((((((((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_ev) == b1_ev))) || (b1_val_t < 1)) || ((((((((((d1_ev == \old(d1_ev)) && (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_val_t <= d1_val)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (\old(b1_ev) < 2)) || !((\old(d0_req_up) == 1))) || !((\old(z_val) == 0))) || (d1_val_t < 1)) || !((b0_val_t == 1))) || ((((((((((d1_ev == \old(d1_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_val_t <= d1_val)) && (b0_ev == 0))) || !((\old(b0_req_up) == 1))) || !((\old(d1_req_up) == 1))) || ((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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))) || !((\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(z_ev) < 2)) || ((((((((((b1_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)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (b0_ev == 0))) || !((\old(b1_req_up) == 1))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev))) || ((((((((((d0_val_t <= d0_val) && (d1_ev <= 0)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val))) || (b1_val_t < 1)) || ((((((((((((((((((2 <= z_ev) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) [2023-11-06 22:03:57,569 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((b1_val_t < 1) || !((b0_ev == 1))) || !((z_val == 0))) || (z_ev < 2)) || ((comp_m1_st == \old(comp_m1_st)) && (1 <= __retres1))) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t)) && ((((((((((((((comp_m1_st == \old(comp_m1_st)) || (b0_ev < 2)) || (b1_val_t < 1)) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && (((((((((((((((b0_ev < 2) || !((d1_ev == 1))) || (b1_val_t < 1)) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (1 <= __retres1)) || (b1_val < b1_val_t))) && (((((((((((((((b0_ev < 2) || (b1_val_t < 1)) || !((d0_ev == 1))) || !((z_val == 0))) || (z_ev < 2)) || ((comp_m1_st == \old(comp_m1_st)) && (1 <= __retres1))) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && (((((((((((((((b0_ev < 2) || (b1_val_t < 1)) || !((b1_ev == 1))) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (1 <= __retres1)) || (b1_val < b1_val_t))) [2023-11-06 22:03:57,569 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((1 <= \result) && (1 <= __retres1)) || (b0_ev < 2)) || (b1_val_t < 1)) || !((b1_ev == 1))) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t)) && ((((((((((((((comp_m1_st == \old(comp_m1_st)) || (b0_ev < 2)) || (b1_val_t < 1)) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && (((((((((((((((b0_ev < 2) || !((d1_ev == 1))) || (b1_val_t < 1)) || (((comp_m1_st == \old(comp_m1_st)) && (1 <= \result)) && (1 <= __retres1))) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && ((((((((((((((b1_val_t < 1) || !((b0_ev == 1))) || (((comp_m1_st == \old(comp_m1_st)) && (1 <= \result)) && (1 <= __retres1))) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && (((((((((((((((b0_ev < 2) || (b1_val_t < 1)) || !((d0_ev == 1))) || (((comp_m1_st == \old(comp_m1_st)) && (1 <= \result)) && (1 <= __retres1))) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) [2023-11-06 22:03:57,654 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || ((((((((((((((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(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2)) && ((((((((((((((((((b1_val_t < 1) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || ((((((((((((((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)))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(b0_ev) < 2))) && ((((((((((((((((((!((comp_m1_st == 0)) || (\old(d0_ev) < 2)) || (((((((((((d1_ev == \old(d1_ev)) && (\old(z_ev) <= z_ev)) && (d0_req_up == 1)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (1 == b1_req_up))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(d0_req_up) == 1))) || !((\old(z_val) == 0))) || (d1_val_t < 1)) || !((b0_val_t == 1))) || !((\old(b0_req_up) == 1))) || !((\old(d1_req_up) == 1))) || !((\old(b0_val) == 0))) || (\old(z_ev) < 2)) || !((\old(b1_req_up) == 1))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || !((\old(z_val) == 0))) || ((((((((((((((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)))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || !((\old(z_val) == 0))) || ((((((((((((((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(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || ((((((((((((((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)))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || ((((((((((((((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(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || !((\old(z_val) == 0))) || ((((((((((((((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)))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || !((\old(z_val) == 0))) || ((((((((((((((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(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) [2023-11-06 22:03:57,654 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((b1_val_t < 1) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || ((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (1 <= d0_val_t)) && (b0_ev == \old(b0_ev))) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (\old(d0_req_up) == d0_req_up)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2)) && ((((((((((((((((((((b1_val_t < 1) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (((((((((((((((2 <= z_ev) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || ((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (1 <= d0_val_t)) && (b0_ev == \old(b0_ev))) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (\old(d0_req_up) == d0_req_up)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || (((((((((((((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)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((((\old(d0_ev) < 2) || (((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (\old(d0_req_up) == d0_req_up)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (2 <= d1_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (((((((((((((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)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || ((((((((((((((((\old(z_val) == 0) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (((((((((((((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)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(b0_ev) < 2))) && ((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || ((((((((((((((((\old(z_val) == 0) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || ((((((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_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))) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (\old(d0_req_up) == d0_req_up)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (((((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (\old(d0_req_up) == d0_req_up)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((b1_val_t < 1) || ((((((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_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))) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (\old(d0_req_up) == d0_req_up)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (((((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (\old(d0_req_up) == d0_req_up)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (((((((((((((((2 <= z_ev) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || (((((((((((((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)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(b0_ev) < 2))) && (((((((((((((((((((!((comp_m1_st == 0)) || (\old(d0_ev) < 2)) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(d0_req_up) == 1))) || !((\old(z_val) == 0))) || (((((((((((d1_ev == \old(d1_ev)) && (\old(z_ev) <= z_ev)) && (d0_req_up == 1)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (d0_req_up == 1)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (d1_val_t < 1)) || !((b0_val_t == 1))) || !((\old(b0_req_up) == 1))) || !((\old(d1_req_up) == 1))) || !((\old(b0_val) == 0))) || (\old(z_ev) < 2)) || !((\old(b1_req_up) == 1))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (\old(d0_req_up) == d0_req_up)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (2 <= d1_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) [2023-11-06 22:03:57,655 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((!((comp_m1_st == 0)) || (\old(d0_ev) < 2)) || (b1_val_t < 1)) || (((((((((((d1_ev == \old(d1_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_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (\old(b1_ev) < 2)) || !((\old(d0_req_up) == 1))) || !((\old(z_val) == 0))) || (((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (d1_val_t < 1)) || !((b0_val_t == 1))) || !((\old(b0_req_up) == 1))) || !((\old(d1_req_up) == 1))) || !((\old(b0_val) == 0))) || (\old(z_ev) < 2)) || (((((((((((d1_ev == \old(d1_ev)) && (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_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || !((\old(b1_req_up) == 1))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2)) && ((((((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < 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)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (\old(d1_ev) < 2)) || (((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || ((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up))) || (b1_val_t < 1)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (\old(d1_ev) < 2)) || (((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((d1_ev == \old(d1_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (((((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || ((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && (((((((((((((((((((((((((((((((d1_ev == \old(d1_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up))) || (((((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || ((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && (((((((((((((((((((((((((((((d1_ev == \old(d1_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up))) || (((((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((d1_ev == \old(d1_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || ((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (((((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || ((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < 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) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_ev) < 2))) [2023-11-06 22:03:57,656 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((b1_val_t < 1) || (((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_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)) && (1 <= b1_val_t)) && (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))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t))) || (0 < \old(b1_ev))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2)) && ((((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || ((((((((((((((\old(z_val) == 0) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (((((((((((((b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((b1_val_t < 1) || (((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (0 < \old(d0_ev))) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2)) || (((((((((((((2 <= z_ev) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)))) && ((((((((((((((((((((((((\old(d0_ev) < 2) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t))) || (b1_val_t < 1)) || (((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_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)) && (1 <= b1_val_t)) && (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) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (((((((((((((b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t))) || (0 < \old(b1_ev))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((((b1_val_t < 1) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || ((((((((((((((\old(z_val) == 0) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || ((((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (\old(b1_ev) < 2)) || (((((((((((((b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(b0_ev) < 2))) && (((((((((((((((((((((((((!((comp_m1_st == 0)) || (\old(d0_ev) < 2)) || (((((((((((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))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(d0_req_up) == 1))) || !((\old(z_val) == 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)) && (\old(b1_ev) == b1_ev))) || (((((((((((d1_ev == \old(d1_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (((((((((((d1_ev == \old(d1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (d1_val_t < 1)) || (((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev))) || (((((((((((d0_val_t <= d0_val) && (d1_ev <= 0)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev))) || !((b0_val_t == 1))) || !((\old(b0_req_up) == 1))) || !((\old(d1_req_up) == 1))) || !((\old(b0_val) == 0))) || (\old(z_ev) < 2)) || (((((((((((b1_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)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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))) || !((\old(b1_req_up) == 1))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((((((((((\old(d0_ev) < 2) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t))) || (b1_val_t < 1)) || (((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_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)) && (1 <= b1_val_t)) && (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) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || ((((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (((((((((((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(b1_ev) < 2)) || (((((((((((((b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2)) || (((((((((((((2 <= z_ev) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)))) [2023-11-06 22:03:57,657 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || ((((((((((((((((((2 <= z_ev) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (\old(b0_ev) < 2)) && ((((((((((((((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val))) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (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)) && (\old(b1_ev) == b1_ev))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || ((((((((((((((((((2 <= z_ev) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((\old(z_val) == 0))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || ((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (2 <= d1_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)) && (b0_ev == 0))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || ((((((((((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(b1_ev) == b1_ev))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || ((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (\old(d1_ev) < 2)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (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)) && (\old(b1_ev) == b1_ev)) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (\old(d1_ev) < 2)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val))) || (b1_val_t < 1)) || ((((((((((((((((((2 <= z_ev) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((\old(z_val) == 0))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || ((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (2 <= d1_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)) && (b0_ev == 0))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((((b1_val_t < 1) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((b1_val_t < 1) || !((\old(z_val) == 0))) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && (((((((((((((((((((((((((!((comp_m1_st == 0)) || (\old(d0_ev) < 2)) || ((((((((((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_ev) == b1_ev))) || (b1_val_t < 1)) || ((((((((((d1_ev == \old(d1_ev)) && (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_val_t <= d1_val)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (\old(b1_ev) < 2)) || !((\old(d0_req_up) == 1))) || !((\old(z_val) == 0))) || (d1_val_t < 1)) || !((b0_val_t == 1))) || ((((((((((d1_ev == \old(d1_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_val_t <= d1_val)) && (b0_ev == 0))) || !((\old(b0_req_up) == 1))) || !((\old(d1_req_up) == 1))) || ((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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))) || !((\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(z_ev) < 2)) || ((((((((((b1_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)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (b0_ev == 0))) || !((\old(b1_req_up) == 1))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev))) || ((((((((((d0_val_t <= d0_val) && (d1_ev <= 0)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val))) || (b1_val_t < 1)) || ((((((((((((((((((2 <= z_ev) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) [2023-11-06 22:03:57,658 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((b1_val_t < 1) || !((b0_ev == 1))) || !((z_val == 0))) || (z_ev < 2)) || ((comp_m1_st == \old(comp_m1_st)) && (1 <= __retres1))) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t)) && ((((((((((((((comp_m1_st == \old(comp_m1_st)) || (b0_ev < 2)) || (b1_val_t < 1)) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && (((((((((((((((b0_ev < 2) || !((d1_ev == 1))) || (b1_val_t < 1)) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (1 <= __retres1)) || (b1_val < b1_val_t))) && (((((((((((((((b0_ev < 2) || (b1_val_t < 1)) || !((d0_ev == 1))) || !((z_val == 0))) || (z_ev < 2)) || ((comp_m1_st == \old(comp_m1_st)) && (1 <= __retres1))) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && (((((((((((((((b0_ev < 2) || (b1_val_t < 1)) || !((b1_ev == 1))) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (1 <= __retres1)) || (b1_val < b1_val_t))) [2023-11-06 22:03:57,659 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((1 <= \result) && (1 <= __retres1)) || (b0_ev < 2)) || (b1_val_t < 1)) || !((b1_ev == 1))) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t)) && ((((((((((((((comp_m1_st == \old(comp_m1_st)) || (b0_ev < 2)) || (b1_val_t < 1)) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && (((((((((((((((b0_ev < 2) || !((d1_ev == 1))) || (b1_val_t < 1)) || (((comp_m1_st == \old(comp_m1_st)) && (1 <= \result)) && (1 <= __retres1))) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && ((((((((((((((b1_val_t < 1) || !((b0_ev == 1))) || (((comp_m1_st == \old(comp_m1_st)) && (1 <= \result)) && (1 <= __retres1))) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && (((((((((((((((b0_ev < 2) || (b1_val_t < 1)) || !((d0_ev == 1))) || (((comp_m1_st == \old(comp_m1_st)) && (1 <= \result)) && (1 <= __retres1))) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) [2023-11-06 22:03:57,713 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:03:57,713 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:03:57,714 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:03:57,718 INFO L158 Benchmark]: Toolchain (without parser) took 162492.85ms. Allocated memory was 169.9MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 134.4MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 564.8MB. Max. memory is 16.1GB. [2023-11-06 22:03:57,718 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 123.7MB. Free memory was 87.8MB in the beginning and 87.8MB in the end (delta: 29.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:03:57,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.40ms. Allocated memory is still 169.9MB. Free memory was 134.4MB in the beginning and 121.1MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:03:57,724 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.56ms. Allocated memory is still 169.9MB. Free memory was 121.1MB in the beginning and 119.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:03:57,726 INFO L158 Benchmark]: Boogie Preprocessor took 37.69ms. Allocated memory is still 169.9MB. Free memory was 119.0MB in the beginning and 116.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:03:57,727 INFO L158 Benchmark]: RCFGBuilder took 659.17ms. Allocated memory is still 169.9MB. Free memory was 116.9MB in the beginning and 98.7MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:03:57,730 INFO L158 Benchmark]: TraceAbstraction took 161110.31ms. Allocated memory was 169.9MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 98.0MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2023-11-06 22:03:57,731 INFO L158 Benchmark]: Witness Printer took 222.18ms. Allocated memory is still 3.5GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:03:57,732 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 123.7MB. Free memory was 87.8MB in the beginning and 87.8MB in the end (delta: 29.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.40ms. Allocated memory is still 169.9MB. Free memory was 134.4MB in the beginning and 121.1MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.56ms. Allocated memory is still 169.9MB. Free memory was 121.1MB in the beginning and 119.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.69ms. Allocated memory is still 169.9MB. Free memory was 119.0MB in the beginning and 116.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 659.17ms. Allocated memory is still 169.9MB. Free memory was 116.9MB in the beginning and 98.7MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 161110.31ms. Allocated memory was 169.9MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 98.0MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 222.18ms. Allocated memory is still 3.5GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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]: a call to reach_error is unreachable For all program executions holds that a 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: 160.7s, OverallIterations: 34, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.7s, AutomataDifference: 33.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 78.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5814 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5772 mSDsluCounter, 13220 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8380 mSDsCounter, 640 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4834 IncrementalHoareTripleChecker+Invalid, 5474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 640 mSolverCounterUnsat, 4840 mSDtfsCounter, 4834 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4598 GetRequests, 4228 SyntacticMatches, 4 SemanticMatches, 366 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11183occurred in iteration=33, InterpolantAutomatonStates: 223, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.6s AutomataMinimizationTime, 34 MinimizatonAttempts, 9916 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 22312 PreInvPairs, 23589 NumberOfFragments, 21592 HoareAnnotationTreeSize, 22312 FomulaSimplifications, 123724 FormulaSimplificationTreeSizeReduction, 20.0s HoareSimplificationTime, 34 FomulaSimplificationsInter, 178413 FormulaSimplificationTreeSizeReductionInter, 58.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 7376 NumberOfCodeBlocks, 7320 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 7448 ConstructedInterpolants, 0 QuantifiedInterpolants, 16548 SizeOfPredicates, 12 NumberOfNonLiveVariables, 15758 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: 279]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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))) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((((((((b1_val_t < 1) || !((b0_ev == 1))) || !((z_val == 0))) || (z_ev < 2)) || ((comp_m1_st == \old(comp_m1_st)) && (1 <= __retres1))) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t)) && ((((((((((((((comp_m1_st == \old(comp_m1_st)) || (b0_ev < 2)) || (b1_val_t < 1)) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && (((((((((((((((b0_ev < 2) || !((d1_ev == 1))) || (b1_val_t < 1)) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (1 <= __retres1)) || (b1_val < b1_val_t))) && (((((((((((((((b0_ev < 2) || (b1_val_t < 1)) || !((d0_ev == 1))) || !((z_val == 0))) || (z_ev < 2)) || ((comp_m1_st == \old(comp_m1_st)) && (1 <= __retres1))) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && (((((((((((((((b0_ev < 2) || (b1_val_t < 1)) || !((b1_ev == 1))) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (1 <= __retres1)) || (b1_val < b1_val_t))) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((((((((((1 <= \result) && (1 <= __retres1)) || (b0_ev < 2)) || (b1_val_t < 1)) || !((b1_ev == 1))) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t)) && ((((((((((((((comp_m1_st == \old(comp_m1_st)) || (b0_ev < 2)) || (b1_val_t < 1)) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && (((((((((((((((b0_ev < 2) || !((d1_ev == 1))) || (b1_val_t < 1)) || (((comp_m1_st == \old(comp_m1_st)) && (1 <= \result)) && (1 <= __retres1))) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && ((((((((((((((b1_val_t < 1) || !((b0_ev == 1))) || (((comp_m1_st == \old(comp_m1_st)) && (1 <= \result)) && (1 <= __retres1))) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && (((((((((((((((b0_ev < 2) || (b1_val_t < 1)) || !((d0_ev == 1))) || (((comp_m1_st == \old(comp_m1_st)) && (1 <= \result)) && (1 <= __retres1))) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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))) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (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))) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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))) - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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))) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((((((((comp_m1_i <= 0) && (0 == 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: 267]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!((comp_m1_st == 0)) || (b0_ev < 2)) || (0 < d0_ev)) || (b1_val_t < 1)) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (d1_ev < 2)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || (1 <= __retres1)) || (b1_ev < 2)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t)) && ((((((((((((((((((d0_ev < 2) || !((comp_m1_st == 0))) || (b0_ev < 2)) || (b1_val_t < 1)) || (0 < b1_ev)) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (d1_ev < 2)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || (1 <= __retres1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && (((((((((((((((((!((comp_m1_st == 0)) || (b0_ev < 2)) || (0 < d0_ev)) || (b1_val_t < 1)) || (0 < b1_ev)) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (d1_ev < 2)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || (1 <= __retres1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && (((((((((((((((((!((comp_m1_st == 0)) || (b0_ev < 2)) || (0 < d1_ev)) || (0 < d0_ev)) || (b1_val_t < 1)) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || (1 <= __retres1)) || (b1_ev < 2)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && (((((((((((((((((!((comp_m1_st == 0)) || (b0_ev < 2)) || (0 < d1_ev)) || (0 < d0_ev)) || (b1_val_t < 1)) || (0 < b1_ev)) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || (1 <= __retres1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && ((((((((((((((((((d0_ev < 2) || !((comp_m1_st == 0))) || (b0_ev < 2)) || (0 < d1_ev)) || (b1_val_t < 1)) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || (1 <= __retres1)) || (b1_ev < 2)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && ((((((((((((((((((d0_ev < 2) || !((comp_m1_st == 0))) || (b0_ev < 2)) || (b1_val_t < 1)) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (d1_ev < 2)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || (1 <= __retres1)) || (b1_ev < 2)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) && ((((((((((((((((((d0_ev < 2) || !((comp_m1_st == 0))) || (b0_ev < 2)) || (0 < d1_ev)) || (b1_val_t < 1)) || (0 < b1_ev)) || !((z_val == 0))) || (z_ev < 2)) || (d1_val_t < 1)) || (b0_val < b0_val_t)) || (b0_val_t < 1)) || (1 <= __retres1)) || !((0 == z_val_t))) || (d1_val < d1_val_t)) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (d0_val < d0_val_t)) || (b1_val < b1_val_t))) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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))) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!((comp_m1_st == 0)) || (\old(d0_ev) < 2)) || (b1_val_t < 1)) || (((((((((((d1_ev == \old(d1_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_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (\old(b1_ev) < 2)) || !((\old(d0_req_up) == 1))) || !((\old(z_val) == 0))) || (((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (d1_val_t < 1)) || !((b0_val_t == 1))) || !((\old(b0_req_up) == 1))) || !((\old(d1_req_up) == 1))) || !((\old(b0_val) == 0))) || (\old(z_ev) < 2)) || (((((((((((d1_ev == \old(d1_ev)) && (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_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || !((\old(b1_req_up) == 1))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2)) && ((((((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < 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)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (\old(d1_ev) < 2)) || (((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || ((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up))) || (b1_val_t < 1)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (\old(d1_ev) < 2)) || (((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((d1_ev == \old(d1_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (((((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || ((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && (((((((((((((((((((((((((((((((d1_ev == \old(d1_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up))) || (((((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || ((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && (((((((((((((((((((((((((((((d1_ev == \old(d1_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up))) || (((((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((d1_ev == \old(d1_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || ((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (((((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || ((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < 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) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_ev) < 2))) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || ((((((((((((((((((2 <= z_ev) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (\old(b0_ev) < 2)) && ((((((((((((((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val))) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (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)) && (\old(b1_ev) == b1_ev))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || ((((((((((((((((((2 <= z_ev) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((\old(z_val) == 0))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || ((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (2 <= d1_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)) && (b0_ev == 0))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || ((((((((((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(b1_ev) == b1_ev))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || ((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (\old(d1_ev) < 2)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (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)) && (\old(b1_ev) == b1_ev)) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (\old(d1_ev) < 2)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val))) || (b1_val_t < 1)) || ((((((((((((((((((2 <= z_ev) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((\old(z_val) == 0))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || ((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (2 <= d1_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)) && (b0_ev == 0))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((((b1_val_t < 1) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((b1_val_t < 1) || !((\old(z_val) == 0))) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && (((((((((((((((((((((((((!((comp_m1_st == 0)) || (\old(d0_ev) < 2)) || ((((((((((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_ev) == b1_ev))) || (b1_val_t < 1)) || ((((((((((d1_ev == \old(d1_ev)) && (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_val_t <= d1_val)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (\old(b1_ev) < 2)) || !((\old(d0_req_up) == 1))) || !((\old(z_val) == 0))) || (d1_val_t < 1)) || !((b0_val_t == 1))) || ((((((((((d1_ev == \old(d1_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_val_t <= d1_val)) && (b0_ev == 0))) || !((\old(b0_req_up) == 1))) || !((\old(d1_req_up) == 1))) || ((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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))) || !((\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(z_ev) < 2)) || ((((((((((b1_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)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (b0_ev == 0))) || !((\old(b1_req_up) == 1))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev))) || ((((((((((d0_val_t <= d0_val) && (d1_ev <= 0)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val))) || (b1_val_t < 1)) || ((((((((((((((((((2 <= z_ev) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || ((((((((((((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))) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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))) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || ((((((((((((((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(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2)) && ((((((((((((((((((b1_val_t < 1) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || ((((((((((((((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)))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(b0_ev) < 2))) && ((((((((((((((((((!((comp_m1_st == 0)) || (\old(d0_ev) < 2)) || (((((((((((d1_ev == \old(d1_ev)) && (\old(z_ev) <= z_ev)) && (d0_req_up == 1)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (1 == b1_req_up))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(d0_req_up) == 1))) || !((\old(z_val) == 0))) || (d1_val_t < 1)) || !((b0_val_t == 1))) || !((\old(b0_req_up) == 1))) || !((\old(d1_req_up) == 1))) || !((\old(b0_val) == 0))) || (\old(z_ev) < 2)) || !((\old(b1_req_up) == 1))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || !((\old(z_val) == 0))) || ((((((((((((((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)))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || !((\old(z_val) == 0))) || ((((((((((((((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(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || ((((((((((((((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)))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || ((((((((((((((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(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || !((\old(z_val) == 0))) || ((((((((((((((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)))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || !((\old(z_val) == 0))) || ((((((((((((((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(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || ((((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(b1_req_up) == b1_req_up)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (b0_req_up == 1)) && (0 == z_val_t)) && (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: 15]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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) && (2 <= z_ev)) && (0 == z_val_t)) && (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))) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((b1_val_t < 1) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || ((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (1 <= d0_val_t)) && (b0_ev == \old(b0_ev))) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (\old(d0_req_up) == d0_req_up)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2)) && ((((((((((((((((((((b1_val_t < 1) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (((((((((((((((2 <= z_ev) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || ((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (1 <= d0_val_t)) && (b0_ev == \old(b0_ev))) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (\old(d0_req_up) == d0_req_up)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || (((((((((((((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)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((((\old(d0_ev) < 2) || (((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (\old(d0_req_up) == d0_req_up)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (2 <= d1_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (((((((((((((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)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (((((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || ((((((((((((((((\old(z_val) == 0) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (((((((((((((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)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(b0_ev) < 2))) && ((((((((((((((((((\old(d0_ev) < 2) || ((((((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || ((((((((((((((((\old(z_val) == 0) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || (b1_val_t < 1)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || ((((((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_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))) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (\old(d0_req_up) == d0_req_up)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (((((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (\old(d0_req_up) == d0_req_up)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((b1_val_t < 1) || ((((((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_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))) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (\old(d0_req_up) == d0_req_up)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (d1_req_up == \old(d1_req_up)))) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || (((((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (\old(d0_req_up) == d0_req_up)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (((((((((((((((2 <= z_ev) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || (((((((((((((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)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (\old(b0_ev) < 2))) && (((((((((((((((((((!((comp_m1_st == 0)) || (\old(d0_ev) < 2)) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(d0_req_up) == 1))) || !((\old(z_val) == 0))) || (((((((((((d1_ev == \old(d1_ev)) && (\old(z_ev) <= z_ev)) && (d0_req_up == 1)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (d0_req_up == 1)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_req_up == 1)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (d1_val_t < 1)) || !((b0_val_t == 1))) || !((\old(b0_req_up) == 1))) || !((\old(d1_req_up) == 1))) || !((\old(b0_val) == 0))) || (\old(z_ev) < 2)) || !((\old(b1_req_up) == 1))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (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)) && (\old(d0_req_up) == d0_req_up)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (d1_req_up == \old(d1_req_up)))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (2 <= d1_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (d1_req_up == \old(d1_req_up)))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((b1_val_t < 1) || (((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_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)) && (1 <= b1_val_t)) && (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))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t))) || (0 < \old(b1_ev))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2)) && ((((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || ((((((((((((((\old(z_val) == 0) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (((((((((((((b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((b1_val_t < 1) || (((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (0 < \old(d0_ev))) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2)) || (((((((((((((2 <= z_ev) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)))) && ((((((((((((((((((((((((\old(d0_ev) < 2) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t))) || (b1_val_t < 1)) || (((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_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)) && (1 <= b1_val_t)) && (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) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (((((((((((((b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t))) || (0 < \old(b1_ev))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((((b1_val_t < 1) || (\old(b1_ev) < 2)) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(b0_ev) < 2))) && ((((((((((((((((((b1_val_t < 1) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (0 < \old(d0_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (0 < \old(b1_ev))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((\old(d0_ev) < 2) || (b1_val_t < 1)) || ((((((((((((((\old(z_val) == 0) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || ((((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (\old(b1_ev) < 2)) || (((((((((((((b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || !((\old(z_val) == 0))) || (0 < \old(d1_ev))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(b0_ev) < 2))) && (((((((((((((((((((((((((!((comp_m1_st == 0)) || (\old(d0_ev) < 2)) || (((((((((((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))) || (b1_val_t < 1)) || (\old(b1_ev) < 2)) || !((\old(d0_req_up) == 1))) || !((\old(z_val) == 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)) && (\old(b1_ev) == b1_ev))) || (((((((((((d1_ev == \old(d1_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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (((((((((((d1_ev == \old(d1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (d1_val_t < 1)) || (((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev))) || (((((((((((d0_val_t <= d0_val) && (d1_ev <= 0)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev))) || !((b0_val_t == 1))) || !((\old(b0_req_up) == 1))) || !((\old(d1_req_up) == 1))) || !((\old(b0_val) == 0))) || (\old(z_ev) < 2)) || (((((((((((b1_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)) && (\old(d0_ev) == d0_ev)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || (((((((((((d1_ev == \old(d1_ev)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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))) || !((\old(b1_req_up) == 1))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2))) && ((((((((((((((((((((((((((((((((\old(d0_ev) < 2) || (((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t))) || (b1_val_t < 1)) || (((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_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)) && (1 <= b1_val_t)) && (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) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0))) || ((((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || (((((((((((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(b1_ev) < 2)) || (((((((((((((b1_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)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || !((\old(z_val) == 0))) || (\old(d0_val) < d0_val_t)) || ((((((((((((((\old(z_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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || (\old(b1_val) < b1_val_t)) || (d1_val_t < 1)) || (((((((((((d1_ev == \old(d1_ev)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_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)) && (\old(b1_ev) == b1_ev))) || (\old(z_ev) < 2)) || (b0_val_t < 1)) || (\old(b0_val) < b0_val_t)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || (((((((((((((((\old(z_val) == 0) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (\old(d0_ev) == d0_ev)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0))) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev))) || !((0 == z_val_t))) || (d0_val_t < 1)) || (0 < comp_m1_i)) || (\old(d1_val) < d1_val_t)) || (((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t)) && (\old(b1_ev) == b1_ev))) || ((((((((((((((((2 <= z_ev) && (\old(z_val) == 0)) && (d1_ev == \old(d1_ev))) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (\old(z_ev) <= z_ev)) && (b0_ev == \old(b0_ev))) && (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)) && (\old(z_req_up) == z_req_up)) && (1 <= d1_val_t))) || (((((((((((((\old(z_val) == 0) && (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)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (\old(z_req_up) == z_req_up))) || (\old(d1_ev) < 2)) || (\old(b0_ev) < 2)) || (((((((((((((2 <= z_ev) && (d1_ev == \old(d1_ev))) && (2 <= b1_ev)) && (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_val_t <= d1_val)) && (\old(z_req_up) == z_req_up)) && (b0_ev == 0)) && (\old(b1_ev) == b1_ev)))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:03:57,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4245b03-bff0-4d8a-aac9-6348fd9a1c3e/bin/uautomizer-verify-WvqO1wxjHP/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