./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 6b4ec56b 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_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:12:24,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:12:24,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:12:24,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:12:24,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:12:24,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:12:24,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:12:24,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:12:24,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:12:24,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:12:24,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:12:24,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:12:24,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:12:24,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:12:24,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:12:24,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:12:24,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:12:24,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:12:24,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:12:24,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:12:24,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:12:24,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:12:24,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:12:24,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:12:24,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:12:24,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:12:24,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:12:24,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:12:24,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:12:24,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:12:24,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:12:24,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:12:24,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:12:24,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:12:24,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:12:24,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:12:24,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:12:24,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:12:24,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:12:24,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:12:24,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:12:24,611 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:12:24,663 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:12:24,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:12:24,667 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:12:24,667 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:12:24,669 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:12:24,669 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:12:24,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:12:24,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:12:24,671 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:12:24,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:12:24,673 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:12:24,673 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:12:24,673 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:12:24,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:12:24,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:12:24,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:12:24,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:12:24,675 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:12:24,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:12:24,675 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:12:24,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:12:24,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:12:24,676 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:12:24,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:12:24,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:12:24,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:12:24,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:12:24,678 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:12:24,678 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:12:24,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:12:24,679 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:12:24,679 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:12:24,680 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:12:24,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/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_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 [2022-11-20 12:12:25,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:12:25,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:12:25,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:12:25,044 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:12:25,045 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:12:25,047 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/systemc/bist_cell.cil.c [2022-11-20 12:12:28,961 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:12:29,303 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:12:29,304 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/sv-benchmarks/c/systemc/bist_cell.cil.c [2022-11-20 12:12:29,314 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/data/8891639d7/a76eb6f8f46c4712b8be26a7cf8005f0/FLAGb074a84f3 [2022-11-20 12:12:29,333 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/data/8891639d7/a76eb6f8f46c4712b8be26a7cf8005f0 [2022-11-20 12:12:29,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:12:29,339 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:12:29,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:12:29,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:12:29,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:12:29,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:12:29" (1/1) ... [2022-11-20 12:12:29,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50439ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:29, skipping insertion in model container [2022-11-20 12:12:29,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:12:29" (1/1) ... [2022-11-20 12:12:29,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:12:29,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:12:29,587 WARN L237 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_bfbe7102-ba49-4982-ba3d-d246ed7676a4/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2022-11-20 12:12:29,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:12:29,663 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:12:29,677 WARN L237 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_bfbe7102-ba49-4982-ba3d-d246ed7676a4/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2022-11-20 12:12:29,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:12:29,762 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:12:29,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:29 WrapperNode [2022-11-20 12:12:29,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:12:29,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:12:29,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:12:29,765 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:12:29,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:29" (1/1) ... [2022-11-20 12:12:29,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:29" (1/1) ... [2022-11-20 12:12:29,816 INFO L138 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 229 [2022-11-20 12:12:29,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:12:29,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:12:29,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:12:29,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:12:29,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:29" (1/1) ... [2022-11-20 12:12:29,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:29" (1/1) ... [2022-11-20 12:12:29,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:29" (1/1) ... [2022-11-20 12:12:29,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:29" (1/1) ... [2022-11-20 12:12:29,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:29" (1/1) ... [2022-11-20 12:12:29,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:29" (1/1) ... [2022-11-20 12:12:29,852 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:29" (1/1) ... [2022-11-20 12:12:29,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:29" (1/1) ... [2022-11-20 12:12:29,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:12:29,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:12:29,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:12:29,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:12:29,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:29" (1/1) ... [2022-11-20 12:12:29,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:12:29,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:29,905 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:12:29,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:12:29,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:12:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-20 12:12:29,968 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-20 12:12:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-20 12:12:29,968 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-20 12:12:29,969 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-20 12:12:29,970 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-20 12:12:29,972 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-20 12:12:29,973 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-20 12:12:29,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:12:29,974 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-20 12:12:29,974 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-20 12:12:29,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:12:29,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:12:30,103 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:12:30,106 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:12:30,670 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:12:30,680 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:12:30,681 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 12:12:30,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:12:30 BoogieIcfgContainer [2022-11-20 12:12:30,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:12:30,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:12:30,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:12:30,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:12:30,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:12:29" (1/3) ... [2022-11-20 12:12:30,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163a1fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:12:30, skipping insertion in model container [2022-11-20 12:12:30,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:29" (2/3) ... [2022-11-20 12:12:30,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163a1fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:12:30, skipping insertion in model container [2022-11-20 12:12:30,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:12:30" (3/3) ... [2022-11-20 12:12:30,695 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2022-11-20 12:12:30,720 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:12:30,721 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:12:30,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:12:30,800 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;@7ccee6be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:12:30,800 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 12:12:30,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 86 states have (on average 1.558139534883721) internal successors, (134), 88 states have internal predecessors, (134), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-20 12:12:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 12:12:30,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:30,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:30,822 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:12:30,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:30,832 INFO L85 PathProgramCache]: Analyzing trace with hash 129401130, now seen corresponding path program 1 times [2022-11-20 12:12:30,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:30,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215230947] [2022-11-20 12:12:30,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:30,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:31,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:12:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:31,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 12:12:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:31,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 12:12:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:31,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:12:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:31,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:12:31,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:31,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215230947] [2022-11-20 12:12:31,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215230947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:31,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:31,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:12:31,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287576133] [2022-11-20 12:12:31,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:31,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:12:31,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:31,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:12:31,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:12:31,689 INFO L87 Difference]: Start difference. First operand has 103 states, 86 states have (on average 1.558139534883721) internal successors, (134), 88 states have internal predecessors, (134), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:12:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:33,142 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2022-11-20 12:12:33,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:12:33,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2022-11-20 12:12:33,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:33,173 INFO L225 Difference]: With dead ends: 281 [2022-11-20 12:12:33,174 INFO L226 Difference]: Without dead ends: 178 [2022-11-20 12:12:33,180 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 [2022-11-20 12:12:33,188 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 211 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:33,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 304 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 12:12:33,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-20 12:12:33,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 117. [2022-11-20 12:12:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.5) internal successors, (150), 101 states have internal predecessors, (150), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-11-20 12:12:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2022-11-20 12:12:33,270 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 42 [2022-11-20 12:12:33,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:33,271 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2022-11-20 12:12:33,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:12:33,272 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2022-11-20 12:12:33,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-20 12:12:33,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:33,277 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:33,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:12:33,278 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:12:33,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:33,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1179475252, now seen corresponding path program 1 times [2022-11-20 12:12:33,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:33,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65945316] [2022-11-20 12:12:33,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:33,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:33,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:12:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:33,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:12:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:33,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:12:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:33,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 12:12:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:33,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:12:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:33,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:12:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:33,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:12:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:33,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 12:12:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:33,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 12:12:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:33,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 12:12:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:33,678 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:12:33,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:33,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65945316] [2022-11-20 12:12:33,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65945316] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:33,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11309869] [2022-11-20 12:12:33,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:33,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:33,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:33,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:33,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:12:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:33,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 12:12:33,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-20 12:12:34,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:34,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11309869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:34,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:34,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-20 12:12:34,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523922395] [2022-11-20 12:12:34,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:34,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:12:34,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:34,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:12:34,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:12:34,036 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:12:34,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:34,093 INFO L93 Difference]: Finished difference Result 227 states and 333 transitions. [2022-11-20 12:12:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:12:34,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-11-20 12:12:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:34,100 INFO L225 Difference]: With dead ends: 227 [2022-11-20 12:12:34,103 INFO L226 Difference]: Without dead ends: 117 [2022-11-20 12:12:34,105 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 [2022-11-20 12:12:34,108 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 128 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:34,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 142 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:12:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-20 12:12:34,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-20 12:12:34,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.49) internal successors, (149), 101 states have internal predecessors, (149), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-11-20 12:12:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2022-11-20 12:12:34,161 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 101 [2022-11-20 12:12:34,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:34,162 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2022-11-20 12:12:34,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:12:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2022-11-20 12:12:34,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-20 12:12:34,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:34,180 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:34,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:34,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:34,389 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:12:34,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:34,390 INFO L85 PathProgramCache]: Analyzing trace with hash -779099534, now seen corresponding path program 1 times [2022-11-20 12:12:34,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:34,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285773337] [2022-11-20 12:12:34,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:34,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:34,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:12:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:34,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:12:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:34,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:12:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:34,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 12:12:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:34,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:12:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:34,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:12:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:34,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:12:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:34,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 12:12:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:34,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 12:12:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:34,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 12:12:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:34,753 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:12:34,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:34,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285773337] [2022-11-20 12:12:34,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285773337] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:34,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628070668] [2022-11-20 12:12:34,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:34,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:34,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:34,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:34,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:12:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:34,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 12:12:34,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 12:12:35,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:35,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628070668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:35,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:35,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-20 12:12:35,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929337484] [2022-11-20 12:12:35,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:35,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:12:35,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:35,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:12:35,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:12:35,194 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:12:35,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:35,494 INFO L93 Difference]: Finished difference Result 356 states and 529 transitions. [2022-11-20 12:12:35,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:12:35,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-11-20 12:12:35,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:35,501 INFO L225 Difference]: With dead ends: 356 [2022-11-20 12:12:35,502 INFO L226 Difference]: Without dead ends: 248 [2022-11-20 12:12:35,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:12:35,510 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 240 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:35,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 407 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:12:35,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-20 12:12:35,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 233. [2022-11-20 12:12:35,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 200 states have (on average 1.485) internal successors, (297), 203 states have internal predecessors, (297), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (27), 20 states have call predecessors, (27), 19 states have call successors, (27) [2022-11-20 12:12:35,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 343 transitions. [2022-11-20 12:12:35,601 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 343 transitions. Word has length 101 [2022-11-20 12:12:35,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:35,605 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 343 transitions. [2022-11-20 12:12:35,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:12:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 343 transitions. [2022-11-20 12:12:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-20 12:12:35,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:35,612 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:35,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:35,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:35,832 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:12:35,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:35,833 INFO L85 PathProgramCache]: Analyzing trace with hash -213976846, now seen corresponding path program 1 times [2022-11-20 12:12:35,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:35,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134898621] [2022-11-20 12:12:35,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:35,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:35,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:12:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:12:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:12:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 12:12:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:12:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:12:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:12:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 12:12:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 12:12:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 12:12:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:12:36,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:36,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134898621] [2022-11-20 12:12:36,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134898621] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:36,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521652723] [2022-11-20 12:12:36,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:36,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:36,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:36,131 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:36,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:12:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 12:12:36,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 12:12:36,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:36,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521652723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:36,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:36,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-20 12:12:36,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396728894] [2022-11-20 12:12:36,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:36,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:12:36,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:36,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:12:36,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:12:36,433 INFO L87 Difference]: Start difference. First operand 233 states and 343 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:12:36,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:36,793 INFO L93 Difference]: Finished difference Result 705 states and 1058 transitions. [2022-11-20 12:12:36,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:12:36,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-11-20 12:12:36,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:36,801 INFO L225 Difference]: With dead ends: 705 [2022-11-20 12:12:36,803 INFO L226 Difference]: Without dead ends: 485 [2022-11-20 12:12:36,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:12:36,809 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 237 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:36,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 393 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:12:36,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-11-20 12:12:36,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2022-11-20 12:12:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 402 states have (on average 1.472636815920398) internal successors, (592), 411 states have internal predecessors, (592), 37 states have call successors, (37), 21 states have call predecessors, (37), 29 states have return successors, (71), 40 states have call predecessors, (71), 37 states have call successors, (71) [2022-11-20 12:12:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 700 transitions. [2022-11-20 12:12:36,947 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 700 transitions. Word has length 101 [2022-11-20 12:12:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:36,948 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 700 transitions. [2022-11-20 12:12:36,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:12:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 700 transitions. [2022-11-20 12:12:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-20 12:12:36,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:36,957 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:36,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:37,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:37,165 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:12:37,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:37,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2077246898, now seen corresponding path program 1 times [2022-11-20 12:12:37,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:37,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971803102] [2022-11-20 12:12:37,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:37,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:12:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:12:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:12:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 12:12:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:12:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:12:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:12:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 12:12:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 12:12:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 12:12:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,441 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:12:37,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:37,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971803102] [2022-11-20 12:12:37,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971803102] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:37,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596845168] [2022-11-20 12:12:37,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:37,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:37,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:37,445 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:37,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:12:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 12:12:37,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 12:12:37,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:37,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596845168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:37,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:37,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-20 12:12:37,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458984557] [2022-11-20 12:12:37,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:37,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:12:37,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:37,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:12:37,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:12:37,740 INFO L87 Difference]: Start difference. First operand 469 states and 700 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:12:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:38,149 INFO L93 Difference]: Finished difference Result 1557 states and 2395 transitions. [2022-11-20 12:12:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:12:38,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-11-20 12:12:38,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:38,162 INFO L225 Difference]: With dead ends: 1557 [2022-11-20 12:12:38,168 INFO L226 Difference]: Without dead ends: 1109 [2022-11-20 12:12:38,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:12:38,171 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 250 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:38,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 435 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:12:38,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2022-11-20 12:12:38,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1021. [2022-11-20 12:12:38,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 880 states have (on average 1.45) internal successors, (1276), 907 states have internal predecessors, (1276), 73 states have call successors, (73), 41 states have call predecessors, (73), 67 states have return successors, (201), 80 states have call predecessors, (201), 73 states have call successors, (201) [2022-11-20 12:12:38,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1550 transitions. [2022-11-20 12:12:38,343 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1550 transitions. Word has length 101 [2022-11-20 12:12:38,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:38,344 INFO L495 AbstractCegarLoop]: Abstraction has 1021 states and 1550 transitions. [2022-11-20 12:12:38,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:12:38,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1550 transitions. [2022-11-20 12:12:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-20 12:12:38,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:38,353 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:38,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:38,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:38,560 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:12:38,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:38,560 INFO L85 PathProgramCache]: Analyzing trace with hash -300696526, now seen corresponding path program 1 times [2022-11-20 12:12:38,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:38,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544861115] [2022-11-20 12:12:38,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:38,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:12:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:12:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:12:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 12:12:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:12:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:12:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:12:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 12:12:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 12:12:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 12:12:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:12:38,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:38,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544861115] [2022-11-20 12:12:38,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544861115] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:38,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183843781] [2022-11-20 12:12:38,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:38,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:38,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:38,813 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:38,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:12:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 12:12:38,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 12:12:39,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:39,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183843781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:39,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:39,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-20 12:12:39,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054130219] [2022-11-20 12:12:39,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:39,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:12:39,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:39,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:12:39,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:12:39,074 INFO L87 Difference]: Start difference. First operand 1021 states and 1550 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:12:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:39,588 INFO L93 Difference]: Finished difference Result 3377 states and 5343 transitions. [2022-11-20 12:12:39,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:12:39,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-11-20 12:12:39,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:39,606 INFO L225 Difference]: With dead ends: 3377 [2022-11-20 12:12:39,607 INFO L226 Difference]: Without dead ends: 2393 [2022-11-20 12:12:39,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:12:39,613 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 245 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:39,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 421 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:12:39,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2022-11-20 12:12:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2261. [2022-11-20 12:12:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 1954 states have (on average 1.4237461617195497) internal successors, (2782), 2035 states have internal predecessors, (2782), 145 states have call successors, (145), 81 states have call predecessors, (145), 161 states have return successors, (611), 160 states have call predecessors, (611), 145 states have call successors, (611) [2022-11-20 12:12:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3538 transitions. [2022-11-20 12:12:39,980 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3538 transitions. Word has length 101 [2022-11-20 12:12:39,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:39,980 INFO L495 AbstractCegarLoop]: Abstraction has 2261 states and 3538 transitions. [2022-11-20 12:12:39,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:12:39,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3538 transitions. [2022-11-20 12:12:40,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-20 12:12:40,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:40,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] [2022-11-20 12:12:40,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:40,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:40,212 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:12:40,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:40,213 INFO L85 PathProgramCache]: Analyzing trace with hash 38237618, now seen corresponding path program 1 times [2022-11-20 12:12:40,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:40,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781437905] [2022-11-20 12:12:40,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:40,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:12:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:12:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:12:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 12:12:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:12:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:12:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:12:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 12:12:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 12:12:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 12:12:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:12:40,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:40,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781437905] [2022-11-20 12:12:40,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781437905] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:40,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116994130] [2022-11-20 12:12:40,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:40,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:40,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:40,440 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:40,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 12:12:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:12:40,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:12:40,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:40,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116994130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:40,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:40,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-11-20 12:12:40,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252860494] [2022-11-20 12:12:40,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:40,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:12:40,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:40,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:12:40,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:12:40,675 INFO L87 Difference]: Start difference. First operand 2261 states and 3538 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:12:40,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:40,984 INFO L93 Difference]: Finished difference Result 4789 states and 7470 transitions. [2022-11-20 12:12:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:12:40,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-11-20 12:12:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:41,006 INFO L225 Difference]: With dead ends: 4789 [2022-11-20 12:12:41,007 INFO L226 Difference]: Without dead ends: 2629 [2022-11-20 12:12:41,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:12:41,016 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 30 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:41,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 704 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:12:41,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2022-11-20 12:12:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2341. [2022-11-20 12:12:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2341 states, 2018 states have (on average 1.4103072348860257) internal successors, (2846), 2099 states have internal predecessors, (2846), 145 states have call successors, (145), 81 states have call predecessors, (145), 177 states have return successors, (643), 176 states have call predecessors, (643), 145 states have call successors, (643) [2022-11-20 12:12:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 3634 transitions. [2022-11-20 12:12:41,332 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 3634 transitions. Word has length 101 [2022-11-20 12:12:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:41,334 INFO L495 AbstractCegarLoop]: Abstraction has 2341 states and 3634 transitions. [2022-11-20 12:12:41,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:12:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 3634 transitions. [2022-11-20 12:12:41,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-20 12:12:41,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:41,350 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:41,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:41,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-20 12:12:41,558 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:12:41,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:41,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1425023028, now seen corresponding path program 1 times [2022-11-20 12:12:41,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:41,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613969139] [2022-11-20 12:12:41,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:41,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:12:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:12:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:12:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 12:12:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:12:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:12:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:12:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 12:12:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 12:12:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 12:12:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:12:41,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:41,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613969139] [2022-11-20 12:12:41,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613969139] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:41,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582957576] [2022-11-20 12:12:41,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:41,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:41,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:41,763 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:41,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 12:12:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:12:41,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:12:41,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:41,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582957576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:41,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:41,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-20 12:12:41,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108178552] [2022-11-20 12:12:41,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:41,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:12:41,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:41,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:12:41,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:12:41,969 INFO L87 Difference]: Start difference. First operand 2341 states and 3634 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:12:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:42,300 INFO L93 Difference]: Finished difference Result 5110 states and 7919 transitions. [2022-11-20 12:12:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:12:42,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 101 [2022-11-20 12:12:42,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:42,320 INFO L225 Difference]: With dead ends: 5110 [2022-11-20 12:12:42,321 INFO L226 Difference]: Without dead ends: 2870 [2022-11-20 12:12:42,329 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 [2022-11-20 12:12:42,331 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 66 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:42,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 273 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:12:42,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2022-11-20 12:12:42,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2578. [2022-11-20 12:12:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2578 states, 2159 states have (on average 1.3756368689207967) internal successors, (2970), 2240 states have internal predecessors, (2970), 209 states have call successors, (209), 113 states have call predecessors, (209), 209 states have return successors, (788), 256 states have call predecessors, (788), 209 states have call successors, (788) [2022-11-20 12:12:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3967 transitions. [2022-11-20 12:12:42,727 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3967 transitions. Word has length 101 [2022-11-20 12:12:42,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:42,728 INFO L495 AbstractCegarLoop]: Abstraction has 2578 states and 3967 transitions. [2022-11-20 12:12:42,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:12:42,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3967 transitions. [2022-11-20 12:12:42,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-20 12:12:42,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:42,745 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:42,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:42,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:42,952 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:12:42,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:42,952 INFO L85 PathProgramCache]: Analyzing trace with hash 457672374, now seen corresponding path program 1 times [2022-11-20 12:12:42,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:42,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181902442] [2022-11-20 12:12:42,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:42,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:12:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:12:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:12:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 12:12:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:12:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:12:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:12:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 12:12:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 12:12:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 12:12:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:12:43,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:43,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181902442] [2022-11-20 12:12:43,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181902442] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:43,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683077214] [2022-11-20 12:12:43,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:43,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:43,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:43,172 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:43,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 12:12:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:12:43,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 12:12:43,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:43,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683077214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:43,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:43,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-20 12:12:43,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104676151] [2022-11-20 12:12:43,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:43,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:12:43,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:43,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:12:43,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:12:43,377 INFO L87 Difference]: Start difference. First operand 2578 states and 3967 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:12:43,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:43,719 INFO L93 Difference]: Finished difference Result 5010 states and 7692 transitions. [2022-11-20 12:12:43,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:12:43,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-11-20 12:12:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:43,739 INFO L225 Difference]: With dead ends: 5010 [2022-11-20 12:12:43,740 INFO L226 Difference]: Without dead ends: 2658 [2022-11-20 12:12:43,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:12:43,751 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 9 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:43,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 554 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:12:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2022-11-20 12:12:44,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2626. [2022-11-20 12:12:44,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2207 states have (on average 1.3674671499773448) internal successors, (3018), 2288 states have internal predecessors, (3018), 209 states have call successors, (209), 113 states have call predecessors, (209), 209 states have return successors, (788), 256 states have call predecessors, (788), 209 states have call successors, (788) [2022-11-20 12:12:44,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4015 transitions. [2022-11-20 12:12:44,116 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 4015 transitions. Word has length 101 [2022-11-20 12:12:44,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:44,117 INFO L495 AbstractCegarLoop]: Abstraction has 2626 states and 4015 transitions. [2022-11-20 12:12:44,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:12:44,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 4015 transitions. [2022-11-20 12:12:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-20 12:12:44,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:44,133 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:44,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:44,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:44,341 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:12:44,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:44,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2122057235, now seen corresponding path program 1 times [2022-11-20 12:12:44,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:44,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478345305] [2022-11-20 12:12:44,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:44,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:12:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:12:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:12:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 12:12:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 12:12:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:12:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 12:12:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 12:12:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-20 12:12:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:12:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:12:44,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:44,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478345305] [2022-11-20 12:12:44,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478345305] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:44,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265256791] [2022-11-20 12:12:44,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:44,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:44,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:44,548 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:44,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 12:12:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:12:44,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 12:12:44,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:44,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265256791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:44,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:44,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-20 12:12:44,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834164090] [2022-11-20 12:12:44,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:44,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:12:44,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:44,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:12:44,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:12:44,744 INFO L87 Difference]: Start difference. First operand 2626 states and 4015 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:12:45,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:45,089 INFO L93 Difference]: Finished difference Result 5324 states and 8539 transitions. [2022-11-20 12:12:45,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:12:45,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2022-11-20 12:12:45,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:45,113 INFO L225 Difference]: With dead ends: 5324 [2022-11-20 12:12:45,113 INFO L226 Difference]: Without dead ends: 2908 [2022-11-20 12:12:45,127 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 [2022-11-20 12:12:45,128 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 17 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:45,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 281 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:12:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2022-11-20 12:12:45,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2908. [2022-11-20 12:12:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2908 states, 2393 states have (on average 1.3522774759715839) internal successors, (3236), 2474 states have internal predecessors, (3236), 273 states have call successors, (273), 145 states have call predecessors, (273), 241 states have return successors, (1046), 320 states have call predecessors, (1046), 273 states have call successors, (1046) [2022-11-20 12:12:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 4555 transitions. [2022-11-20 12:12:45,631 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 4555 transitions. Word has length 104 [2022-11-20 12:12:45,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:45,632 INFO L495 AbstractCegarLoop]: Abstraction has 2908 states and 4555 transitions. [2022-11-20 12:12:45,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:12:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 4555 transitions. [2022-11-20 12:12:45,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-20 12:12:45,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:45,657 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:45,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:45,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 12:12:45,865 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:12:45,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:45,865 INFO L85 PathProgramCache]: Analyzing trace with hash 163482449, now seen corresponding path program 1 times [2022-11-20 12:12:45,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:45,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717423319] [2022-11-20 12:12:45,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:46,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:12:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:46,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:12:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:46,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:12:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:46,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 12:12:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:46,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 12:12:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:46,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:12:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:46,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 12:12:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:46,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 12:12:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:46,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-20 12:12:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:46,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:12:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:12:46,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:46,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717423319] [2022-11-20 12:12:46,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717423319] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:46,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95265703] [2022-11-20 12:12:46,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:46,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:46,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:46,099 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:46,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 12:12:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:46,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 12:12:46,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:12:46,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:46,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95265703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:46,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:46,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-20 12:12:46,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089052415] [2022-11-20 12:12:46,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:46,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:12:46,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:46,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:12:46,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:12:46,374 INFO L87 Difference]: Start difference. First operand 2908 states and 4555 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:12:47,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:47,280 INFO L93 Difference]: Finished difference Result 9208 states and 15036 transitions. [2022-11-20 12:12:47,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:12:47,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2022-11-20 12:12:47,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:47,335 INFO L225 Difference]: With dead ends: 9208 [2022-11-20 12:12:47,335 INFO L226 Difference]: Without dead ends: 6558 [2022-11-20 12:12:47,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:12:47,349 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 210 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:47,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 743 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:12:47,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6558 states. [2022-11-20 12:12:48,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6558 to 6458. [2022-11-20 12:12:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6458 states, 5429 states have (on average 1.3494197826487382) internal successors, (7326), 5688 states have internal predecessors, (7326), 481 states have call successors, (481), 257 states have call predecessors, (481), 547 states have return successors, (2540), 576 states have call predecessors, (2540), 481 states have call successors, (2540) [2022-11-20 12:12:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 10347 transitions. [2022-11-20 12:12:48,314 INFO L78 Accepts]: Start accepts. Automaton has 6458 states and 10347 transitions. Word has length 104 [2022-11-20 12:12:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:48,314 INFO L495 AbstractCegarLoop]: Abstraction has 6458 states and 10347 transitions. [2022-11-20 12:12:48,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:12:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 6458 states and 10347 transitions. [2022-11-20 12:12:48,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-20 12:12:48,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:48,365 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:48,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:48,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:48,573 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:12:48,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:48,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1052671277, now seen corresponding path program 1 times [2022-11-20 12:12:48,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:48,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819865992] [2022-11-20 12:12:48,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:48,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:12:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:12:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:12:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 12:12:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 12:12:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:12:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 12:12:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 12:12:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-20 12:12:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:12:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:12:48,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:48,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819865992] [2022-11-20 12:12:48,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819865992] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:48,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268842474] [2022-11-20 12:12:48,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:48,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:48,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:48,810 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:48,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 12:12:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 12:12:48,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-20 12:12:49,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:49,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268842474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:49,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:49,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-11-20 12:12:49,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013911371] [2022-11-20 12:12:49,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:49,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:12:49,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:49,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:12:49,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:12:49,027 INFO L87 Difference]: Start difference. First operand 6458 states and 10347 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:12:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:50,333 INFO L93 Difference]: Finished difference Result 14114 states and 22261 transitions. [2022-11-20 12:12:50,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:12:50,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2022-11-20 12:12:50,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:50,424 INFO L225 Difference]: With dead ends: 14114 [2022-11-20 12:12:50,425 INFO L226 Difference]: Without dead ends: 7922 [2022-11-20 12:12:50,454 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 [2022-11-20 12:12:50,456 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 77 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:50,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 370 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:12:50,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2022-11-20 12:12:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 6458. [2022-11-20 12:12:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6458 states, 5429 states have (on average 1.3490513906796833) internal successors, (7324), 5688 states have internal predecessors, (7324), 481 states have call successors, (481), 257 states have call predecessors, (481), 547 states have return successors, (2540), 576 states have call predecessors, (2540), 481 states have call successors, (2540) [2022-11-20 12:12:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 10345 transitions. [2022-11-20 12:12:51,689 INFO L78 Accepts]: Start accepts. Automaton has 6458 states and 10345 transitions. Word has length 104 [2022-11-20 12:12:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:51,691 INFO L495 AbstractCegarLoop]: Abstraction has 6458 states and 10345 transitions. [2022-11-20 12:12:51,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:12:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 6458 states and 10345 transitions. [2022-11-20 12:12:51,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-20 12:12:51,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:51,743 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:51,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:51,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:51,952 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:12:51,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:51,953 INFO L85 PathProgramCache]: Analyzing trace with hash -611500932, now seen corresponding path program 1 times [2022-11-20 12:12:51,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:51,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959150804] [2022-11-20 12:12:51,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:51,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:52,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:12:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:52,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:52,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 12:12:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:52,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 12:12:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:52,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 12:12:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:52,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 12:12:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:52,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-20 12:12:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:52,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 12:12:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:52,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:12:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:52,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 12:12:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:52,172 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:12:52,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:52,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959150804] [2022-11-20 12:12:52,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959150804] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:52,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98552859] [2022-11-20 12:12:52,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:52,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:52,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:52,176 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:52,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 12:12:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:52,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:12:52,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:52,353 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 12:12:52,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:52,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98552859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:52,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:52,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-20 12:12:52,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653147329] [2022-11-20 12:12:52,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:52,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:12:52,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:52,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:12:52,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:12:52,359 INFO L87 Difference]: Start difference. First operand 6458 states and 10345 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:12:53,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:53,213 INFO L93 Difference]: Finished difference Result 12874 states and 20913 transitions. [2022-11-20 12:12:53,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:12:53,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 107 [2022-11-20 12:12:53,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:53,256 INFO L225 Difference]: With dead ends: 12874 [2022-11-20 12:12:53,256 INFO L226 Difference]: Without dead ends: 6894 [2022-11-20 12:12:53,280 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 [2022-11-20 12:12:53,282 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 19 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:53,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 286 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:12:53,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6894 states. [2022-11-20 12:12:54,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6894 to 6894. [2022-11-20 12:12:54,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6894 states, 5721 states have (on average 1.340325117986366) internal successors, (7668), 5980 states have internal predecessors, (7668), 577 states have call successors, (577), 305 states have call predecessors, (577), 595 states have return successors, (2916), 672 states have call predecessors, (2916), 577 states have call successors, (2916) [2022-11-20 12:12:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6894 states to 6894 states and 11161 transitions. [2022-11-20 12:12:54,332 INFO L78 Accepts]: Start accepts. Automaton has 6894 states and 11161 transitions. Word has length 107 [2022-11-20 12:12:54,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:54,332 INFO L495 AbstractCegarLoop]: Abstraction has 6894 states and 11161 transitions. [2022-11-20 12:12:54,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:12:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 6894 states and 11161 transitions. [2022-11-20 12:12:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-20 12:12:54,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:54,378 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:54,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:54,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:54,586 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:12:54,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:54,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1264981886, now seen corresponding path program 1 times [2022-11-20 12:12:54,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:54,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198335798] [2022-11-20 12:12:54,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:54,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:54,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:12:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:54,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:54,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 12:12:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:54,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 12:12:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:54,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 12:12:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:54,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 12:12:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:54,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-20 12:12:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:54,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 12:12:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:54,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:12:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:54,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 12:12:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:12:54,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:54,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198335798] [2022-11-20 12:12:54,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198335798] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:54,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907234613] [2022-11-20 12:12:54,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:54,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:54,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:54,832 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:54,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 12:12:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:55,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 12:12:55,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:12:55,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:55,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907234613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:55,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:55,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-20 12:12:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046500878] [2022-11-20 12:12:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:55,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:12:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:55,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:12:55,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:12:55,136 INFO L87 Difference]: Start difference. First operand 6894 states and 11161 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:12:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:56,462 INFO L93 Difference]: Finished difference Result 13370 states and 21103 transitions. [2022-11-20 12:12:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:12:56,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 107 [2022-11-20 12:12:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:56,501 INFO L225 Difference]: With dead ends: 13370 [2022-11-20 12:12:56,502 INFO L226 Difference]: Without dead ends: 7018 [2022-11-20 12:12:56,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:12:56,523 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 198 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:56,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 707 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:12:56,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7018 states. [2022-11-20 12:12:57,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7018 to 7014. [2022-11-20 12:12:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7014 states, 5817 states have (on average 1.3312704143029053) internal successors, (7744), 6100 states have internal predecessors, (7744), 577 states have call successors, (577), 305 states have call predecessors, (577), 619 states have return successors, (2560), 672 states have call predecessors, (2560), 577 states have call successors, (2560) [2022-11-20 12:12:57,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 10881 transitions. [2022-11-20 12:12:57,425 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 10881 transitions. Word has length 107 [2022-11-20 12:12:57,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:57,426 INFO L495 AbstractCegarLoop]: Abstraction has 7014 states and 10881 transitions. [2022-11-20 12:12:57,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:12:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 10881 transitions. [2022-11-20 12:12:57,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-20 12:12:57,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:57,468 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:57,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:57,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:57,676 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:12:57,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:57,677 INFO L85 PathProgramCache]: Analyzing trace with hash -549218888, now seen corresponding path program 2 times [2022-11-20 12:12:57,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:57,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715473665] [2022-11-20 12:12:57,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:57,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:57,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:12:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:57,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:57,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 12:12:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:57,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 12:12:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:57,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 12:12:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:57,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 12:12:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:57,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-20 12:12:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:57,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 12:12:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:57,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:12:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:57,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 12:12:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:57,903 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:12:57,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:57,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715473665] [2022-11-20 12:12:57,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715473665] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:57,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349931759] [2022-11-20 12:12:57,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:12:57,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:57,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:57,907 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:57,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 12:12:58,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 12:12:58,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:12:58,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 12:12:58,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-20 12:12:58,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:58,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349931759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:58,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:58,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-20 12:12:58,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97107204] [2022-11-20 12:12:58,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:58,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:12:58,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:58,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:12:58,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:12:58,095 INFO L87 Difference]: Start difference. First operand 7014 states and 10881 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-20 12:12:59,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:59,187 INFO L93 Difference]: Finished difference Result 10122 states and 18596 transitions. [2022-11-20 12:12:59,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:12:59,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 107 [2022-11-20 12:12:59,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:59,257 INFO L225 Difference]: With dead ends: 10122 [2022-11-20 12:12:59,257 INFO L226 Difference]: Without dead ends: 10118 [2022-11-20 12:12:59,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:12:59,269 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 117 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:59,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 759 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:12:59,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10118 states. [2022-11-20 12:13:00,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10118 to 7206. [2022-11-20 12:13:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7206 states, 6009 states have (on average 1.3206856382093526) internal successors, (7936), 6292 states have internal predecessors, (7936), 577 states have call successors, (577), 305 states have call predecessors, (577), 619 states have return successors, (2560), 672 states have call predecessors, (2560), 577 states have call successors, (2560) [2022-11-20 12:13:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7206 states to 7206 states and 11073 transitions. [2022-11-20 12:13:00,333 INFO L78 Accepts]: Start accepts. Automaton has 7206 states and 11073 transitions. Word has length 107 [2022-11-20 12:13:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:00,334 INFO L495 AbstractCegarLoop]: Abstraction has 7206 states and 11073 transitions. [2022-11-20 12:13:00,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-20 12:13:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 7206 states and 11073 transitions. [2022-11-20 12:13:00,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-20 12:13:00,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:00,364 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:00,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 12:13:00,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 12:13:00,571 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:00,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:00,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1225788474, now seen corresponding path program 1 times [2022-11-20 12:13:00,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:00,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318501287] [2022-11-20 12:13:00,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:00,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:00,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:00,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:13:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:00,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 12:13:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:00,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 12:13:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:00,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 12:13:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:00,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 12:13:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:00,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-20 12:13:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:00,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 12:13:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:00,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:13:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:00,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 12:13:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:13:00,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:00,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318501287] [2022-11-20 12:13:00,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318501287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:13:00,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353636205] [2022-11-20 12:13:00,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:00,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:00,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:13:00,763 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:13:00,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 12:13:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:00,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:13:00,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:13:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-20 12:13:00,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:13:00,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353636205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:00,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:13:00,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-11-20 12:13:00,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733559781] [2022-11-20 12:13:00,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:00,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:13:00,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:00,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:13:00,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:13:00,982 INFO L87 Difference]: Start difference. First operand 7206 states and 11073 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-20 12:13:01,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:01,986 INFO L93 Difference]: Finished difference Result 14926 states and 24105 transitions. [2022-11-20 12:13:01,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:13:01,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 107 [2022-11-20 12:13:01,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:02,041 INFO L225 Difference]: With dead ends: 14926 [2022-11-20 12:13:02,042 INFO L226 Difference]: Without dead ends: 8278 [2022-11-20 12:13:02,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:13:02,064 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 40 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:13:02,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 875 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:13:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8278 states. [2022-11-20 12:13:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8278 to 7110. [2022-11-20 12:13:03,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7110 states, 5913 states have (on average 1.3150684931506849) internal successors, (7776), 6196 states have internal predecessors, (7776), 577 states have call successors, (577), 305 states have call predecessors, (577), 619 states have return successors, (2560), 672 states have call predecessors, (2560), 577 states have call successors, (2560) [2022-11-20 12:13:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7110 states to 7110 states and 10913 transitions. [2022-11-20 12:13:03,119 INFO L78 Accepts]: Start accepts. Automaton has 7110 states and 10913 transitions. Word has length 107 [2022-11-20 12:13:03,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:03,120 INFO L495 AbstractCegarLoop]: Abstraction has 7110 states and 10913 transitions. [2022-11-20 12:13:03,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-20 12:13:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 7110 states and 10913 transitions. [2022-11-20 12:13:03,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-20 12:13:03,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:03,161 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:03,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 12:13:03,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 12:13:03,368 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:03,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:03,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1916204999, now seen corresponding path program 1 times [2022-11-20 12:13:03,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:03,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265495458] [2022-11-20 12:13:03,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:03,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:03,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:03,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:13:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:03,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 12:13:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:03,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 12:13:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:03,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 12:13:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:03,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 12:13:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:03,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-20 12:13:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:03,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 12:13:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:03,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 12:13:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:03,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 12:13:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-20 12:13:03,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:03,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265495458] [2022-11-20 12:13:03,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265495458] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:13:03,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793193309] [2022-11-20 12:13:03,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:03,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:03,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:13:03,587 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:13:03,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 12:13:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:03,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 12:13:03,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:13:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-20 12:13:03,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:13:03,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793193309] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:03,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:13:03,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-11-20 12:13:03,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473037065] [2022-11-20 12:13:03,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:03,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:13:03,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:03,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:13:03,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:13:03,816 INFO L87 Difference]: Start difference. First operand 7110 states and 10913 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:13:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:05,108 INFO L93 Difference]: Finished difference Result 15142 states and 23023 transitions. [2022-11-20 12:13:05,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:13:05,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 110 [2022-11-20 12:13:05,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:05,163 INFO L225 Difference]: With dead ends: 15142 [2022-11-20 12:13:05,163 INFO L226 Difference]: Without dead ends: 8334 [2022-11-20 12:13:05,190 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 [2022-11-20 12:13:05,191 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 79 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 352 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:13:05,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 352 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:13:05,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8334 states. [2022-11-20 12:13:06,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8334 to 7110. [2022-11-20 12:13:06,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7110 states, 5913 states have (on average 1.3143920175883645) internal successors, (7772), 6196 states have internal predecessors, (7772), 577 states have call successors, (577), 305 states have call predecessors, (577), 619 states have return successors, (2560), 672 states have call predecessors, (2560), 577 states have call successors, (2560) [2022-11-20 12:13:06,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7110 states to 7110 states and 10909 transitions. [2022-11-20 12:13:06,363 INFO L78 Accepts]: Start accepts. Automaton has 7110 states and 10909 transitions. Word has length 110 [2022-11-20 12:13:06,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:06,363 INFO L495 AbstractCegarLoop]: Abstraction has 7110 states and 10909 transitions. [2022-11-20 12:13:06,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:13:06,364 INFO L276 IsEmpty]: Start isEmpty. Operand 7110 states and 10909 transitions. [2022-11-20 12:13:06,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-20 12:13:06,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:06,394 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:06,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-20 12:13:06,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 12:13:06,601 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:06,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:06,601 INFO L85 PathProgramCache]: Analyzing trace with hash -406385611, now seen corresponding path program 1 times [2022-11-20 12:13:06,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:06,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796483609] [2022-11-20 12:13:06,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:06,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:06,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 12:13:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:06,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 12:13:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:06,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:13:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:06,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:13:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:06,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:13:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:06,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-20 12:13:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:06,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 12:13:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:06,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:13:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:06,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 12:13:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-20 12:13:06,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:06,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796483609] [2022-11-20 12:13:06,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796483609] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:13:06,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476794788] [2022-11-20 12:13:06,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:06,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:06,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:13:06,794 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:13:06,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 12:13:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:06,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:13:06,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:13:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 12:13:06,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:13:06,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476794788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:06,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:13:06,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-20 12:13:06,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261633419] [2022-11-20 12:13:06,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:06,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:13:06,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:06,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:13:06,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:13:06,973 INFO L87 Difference]: Start difference. First operand 7110 states and 10909 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:13:07,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:07,846 INFO L93 Difference]: Finished difference Result 14358 states and 22185 transitions. [2022-11-20 12:13:07,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:13:07,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 113 [2022-11-20 12:13:07,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:07,890 INFO L225 Difference]: With dead ends: 14358 [2022-11-20 12:13:07,891 INFO L226 Difference]: Without dead ends: 7774 [2022-11-20 12:13:07,913 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 [2022-11-20 12:13:07,914 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 21 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:13:07,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 286 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:13:07,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7774 states. [2022-11-20 12:13:08,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7774 to 7774. [2022-11-20 12:13:08,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7774 states, 6361 states have (on average 1.301682125451973) internal successors, (8280), 6644 states have internal predecessors, (8280), 721 states have call successors, (721), 377 states have call predecessors, (721), 691 states have return successors, (3000), 816 states have call predecessors, (3000), 721 states have call successors, (3000) [2022-11-20 12:13:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7774 states to 7774 states and 12001 transitions. [2022-11-20 12:13:08,702 INFO L78 Accepts]: Start accepts. Automaton has 7774 states and 12001 transitions. Word has length 113 [2022-11-20 12:13:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:08,702 INFO L495 AbstractCegarLoop]: Abstraction has 7774 states and 12001 transitions. [2022-11-20 12:13:08,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:13:08,702 INFO L276 IsEmpty]: Start isEmpty. Operand 7774 states and 12001 transitions. [2022-11-20 12:13:08,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-20 12:13:08,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:08,736 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:08,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 12:13:08,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 12:13:08,943 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:08,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:08,944 INFO L85 PathProgramCache]: Analyzing trace with hash -992661833, now seen corresponding path program 1 times [2022-11-20 12:13:08,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:08,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720477668] [2022-11-20 12:13:08,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:08,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:09,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:09,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 12:13:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:09,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 12:13:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:09,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:13:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:09,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:13:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:09,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:13:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:09,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-20 12:13:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:09,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 12:13:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:09,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:13:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:09,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 12:13:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-20 12:13:09,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:09,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720477668] [2022-11-20 12:13:09,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720477668] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:13:09,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300433398] [2022-11-20 12:13:09,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:09,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:09,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:13:09,175 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:13:09,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 12:13:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:09,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 12:13:09,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:13:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:13:09,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:13:09,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300433398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:09,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:13:09,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-20 12:13:09,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677209787] [2022-11-20 12:13:09,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:09,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:13:09,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:09,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:13:09,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:13:09,444 INFO L87 Difference]: Start difference. First operand 7774 states and 12001 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:13:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:10,550 INFO L93 Difference]: Finished difference Result 15082 states and 22658 transitions. [2022-11-20 12:13:10,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:13:10,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 113 [2022-11-20 12:13:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:10,592 INFO L225 Difference]: With dead ends: 15082 [2022-11-20 12:13:10,592 INFO L226 Difference]: Without dead ends: 7922 [2022-11-20 12:13:10,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:13:10,615 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 194 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:13:10,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 662 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:13:10,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2022-11-20 12:13:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 7918. [2022-11-20 12:13:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7918 states, 6469 states have (on average 1.2916988715411966) internal successors, (8356), 6788 states have internal predecessors, (8356), 721 states have call successors, (721), 377 states have call predecessors, (721), 727 states have return successors, (2680), 816 states have call predecessors, (2680), 721 states have call successors, (2680) [2022-11-20 12:13:11,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7918 states to 7918 states and 11757 transitions. [2022-11-20 12:13:11,713 INFO L78 Accepts]: Start accepts. Automaton has 7918 states and 11757 transitions. Word has length 113 [2022-11-20 12:13:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:11,714 INFO L495 AbstractCegarLoop]: Abstraction has 7918 states and 11757 transitions. [2022-11-20 12:13:11,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:13:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 7918 states and 11757 transitions. [2022-11-20 12:13:11,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-20 12:13:11,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:11,736 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:11,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-20 12:13:11,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:11,936 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:11,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:11,937 INFO L85 PathProgramCache]: Analyzing trace with hash -38721675, now seen corresponding path program 1 times [2022-11-20 12:13:11,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:11,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951503709] [2022-11-20 12:13:11,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:11,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:12,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:12,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 12:13:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:12,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 12:13:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:12,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:13:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:12,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:13:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:12,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:13:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:12,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-20 12:13:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:12,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 12:13:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:12,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:13:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:12,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 12:13:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-20 12:13:12,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:12,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951503709] [2022-11-20 12:13:12,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951503709] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:13:12,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827453278] [2022-11-20 12:13:12,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:12,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:12,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:13:12,123 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:13:12,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 12:13:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:12,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 12:13:12,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:13:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-20 12:13:12,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:13:12,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827453278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:12,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:13:12,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-11-20 12:13:12,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258327861] [2022-11-20 12:13:12,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:12,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:13:12,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:12,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:13:12,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:13:12,341 INFO L87 Difference]: Start difference. First operand 7918 states and 11757 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:13:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:13,403 INFO L93 Difference]: Finished difference Result 16338 states and 24119 transitions. [2022-11-20 12:13:13,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:13:13,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 113 [2022-11-20 12:13:13,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:13,447 INFO L225 Difference]: With dead ends: 16338 [2022-11-20 12:13:13,448 INFO L226 Difference]: Without dead ends: 8782 [2022-11-20 12:13:13,470 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 [2022-11-20 12:13:13,471 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 81 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 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 [2022-11-20 12:13:13,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 334 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:13:13,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8782 states. [2022-11-20 12:13:14,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8782 to 7918. [2022-11-20 12:13:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7918 states, 6469 states have (on average 1.2904622043592517) internal successors, (8348), 6788 states have internal predecessors, (8348), 721 states have call successors, (721), 377 states have call predecessors, (721), 727 states have return successors, (2680), 816 states have call predecessors, (2680), 721 states have call successors, (2680) [2022-11-20 12:13:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7918 states to 7918 states and 11749 transitions. [2022-11-20 12:13:14,521 INFO L78 Accepts]: Start accepts. Automaton has 7918 states and 11749 transitions. Word has length 113 [2022-11-20 12:13:14,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:14,521 INFO L495 AbstractCegarLoop]: Abstraction has 7918 states and 11749 transitions. [2022-11-20 12:13:14,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:13:14,522 INFO L276 IsEmpty]: Start isEmpty. Operand 7918 states and 11749 transitions. [2022-11-20 12:13:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-20 12:13:14,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:14,542 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:14,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-20 12:13:14,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:14,743 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:14,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:14,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1693209122, now seen corresponding path program 1 times [2022-11-20 12:13:14,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:14,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097647708] [2022-11-20 12:13:14,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:14,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:14,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:14,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 12:13:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:14,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:13:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:14,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 12:13:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:14,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:13:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:14,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 12:13:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:14,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 12:13:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:14,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 12:13:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:14,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 12:13:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:14,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 12:13:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 12:13:14,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:14,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097647708] [2022-11-20 12:13:14,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097647708] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:13:14,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022345991] [2022-11-20 12:13:14,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:14,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:14,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:13:14,926 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:13:14,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-20 12:13:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:15,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:13:15,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:13:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 12:13:15,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:13:15,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022345991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:15,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:13:15,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-20 12:13:15,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365113376] [2022-11-20 12:13:15,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:15,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:13:15,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:15,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:13:15,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:13:15,114 INFO L87 Difference]: Start difference. First operand 7918 states and 11749 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:13:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:16,403 INFO L93 Difference]: Finished difference Result 16238 states and 24098 transitions. [2022-11-20 12:13:16,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:13:16,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 116 [2022-11-20 12:13:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:16,454 INFO L225 Difference]: With dead ends: 16238 [2022-11-20 12:13:16,454 INFO L226 Difference]: Without dead ends: 8918 [2022-11-20 12:13:16,480 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 [2022-11-20 12:13:16,482 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 23 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:13:16,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 286 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:13:16,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8918 states. [2022-11-20 12:13:17,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8918 to 8918. [2022-11-20 12:13:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8918 states, 7145 states have (on average 1.2717984604618615) internal successors, (9087), 7464 states have internal predecessors, (9087), 937 states have call successors, (937), 485 states have call predecessors, (937), 835 states have return successors, (3216), 1032 states have call predecessors, (3216), 937 states have call successors, (3216) [2022-11-20 12:13:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8918 states to 8918 states and 13240 transitions. [2022-11-20 12:13:17,790 INFO L78 Accepts]: Start accepts. Automaton has 8918 states and 13240 transitions. Word has length 116 [2022-11-20 12:13:17,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:17,791 INFO L495 AbstractCegarLoop]: Abstraction has 8918 states and 13240 transitions. [2022-11-20 12:13:17,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:13:17,791 INFO L276 IsEmpty]: Start isEmpty. Operand 8918 states and 13240 transitions. [2022-11-20 12:13:17,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-20 12:13:17,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:17,815 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:17,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-20 12:13:18,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:18,016 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:18,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:18,016 INFO L85 PathProgramCache]: Analyzing trace with hash -265365664, now seen corresponding path program 1 times [2022-11-20 12:13:18,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:18,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053436701] [2022-11-20 12:13:18,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:18,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:18,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:18,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 12:13:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:18,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:13:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:18,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 12:13:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:18,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:13:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:18,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 12:13:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:18,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 12:13:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:18,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 12:13:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:18,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 12:13:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:18,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 12:13:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:18,211 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 12:13:18,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:18,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053436701] [2022-11-20 12:13:18,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053436701] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:13:18,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856290122] [2022-11-20 12:13:18,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:18,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:18,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:13:18,214 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:13:18,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-20 12:13:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:18,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 12:13:18,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:13:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:13:18,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:13:18,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856290122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:18,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:13:18,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2022-11-20 12:13:18,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805558326] [2022-11-20 12:13:18,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:18,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:13:18,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:18,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:13:18,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:13:18,493 INFO L87 Difference]: Start difference. First operand 8918 states and 13240 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:13:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:19,725 INFO L93 Difference]: Finished difference Result 17280 states and 24901 transitions. [2022-11-20 12:13:19,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:13:19,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 116 [2022-11-20 12:13:19,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:19,772 INFO L225 Difference]: With dead ends: 17280 [2022-11-20 12:13:19,773 INFO L226 Difference]: Without dead ends: 9084 [2022-11-20 12:13:19,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:13:19,801 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 190 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:13:19,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 632 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:13:19,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9084 states. [2022-11-20 12:13:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9084 to 9080. [2022-11-20 12:13:20,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9080 states, 7253 states have (on average 1.2596167103267613) internal successors, (9136), 7626 states have internal predecessors, (9136), 937 states have call successors, (937), 485 states have call predecessors, (937), 889 states have return successors, (2920), 1032 states have call predecessors, (2920), 937 states have call successors, (2920) [2022-11-20 12:13:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9080 states to 9080 states and 12993 transitions. [2022-11-20 12:13:20,918 INFO L78 Accepts]: Start accepts. Automaton has 9080 states and 12993 transitions. Word has length 116 [2022-11-20 12:13:20,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:20,919 INFO L495 AbstractCegarLoop]: Abstraction has 9080 states and 12993 transitions. [2022-11-20 12:13:20,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:13:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 9080 states and 12993 transitions. [2022-11-20 12:13:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-20 12:13:20,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:20,956 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:20,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-20 12:13:21,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-20 12:13:21,163 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:21,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:21,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1481519390, now seen corresponding path program 1 times [2022-11-20 12:13:21,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:21,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210359499] [2022-11-20 12:13:21,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:21,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:21,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:21,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 12:13:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:21,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:13:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:21,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 12:13:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:21,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:13:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:21,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 12:13:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:21,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 12:13:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:21,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 12:13:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:21,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 12:13:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:21,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 12:13:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 12:13:21,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:21,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210359499] [2022-11-20 12:13:21,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210359499] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:13:21,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198075116] [2022-11-20 12:13:21,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:21,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:21,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:13:21,345 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:13:21,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-20 12:13:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:21,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 12:13:21,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:13:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-20 12:13:21,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:13:21,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198075116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:21,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:13:21,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2022-11-20 12:13:21,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859564178] [2022-11-20 12:13:21,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:21,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:13:21,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:21,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:13:21,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:13:21,592 INFO L87 Difference]: Start difference. First operand 9080 states and 12993 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:13:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:22,449 INFO L93 Difference]: Finished difference Result 14370 states and 20213 transitions. [2022-11-20 12:13:22,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:13:22,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 116 [2022-11-20 12:13:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:22,481 INFO L225 Difference]: With dead ends: 14370 [2022-11-20 12:13:22,481 INFO L226 Difference]: Without dead ends: 5904 [2022-11-20 12:13:22,503 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 [2022-11-20 12:13:22,503 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 96 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:13:22,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 446 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:13:22,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5904 states. [2022-11-20 12:13:23,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5904 to 5808. [2022-11-20 12:13:23,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5808 states, 4616 states have (on average 1.2606152512998268) internal successors, (5819), 4870 states have internal predecessors, (5819), 609 states have call successors, (609), 313 states have call predecessors, (609), 582 states have return successors, (1854), 656 states have call predecessors, (1854), 609 states have call successors, (1854) [2022-11-20 12:13:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5808 states to 5808 states and 8282 transitions. [2022-11-20 12:13:23,335 INFO L78 Accepts]: Start accepts. Automaton has 5808 states and 8282 transitions. Word has length 116 [2022-11-20 12:13:23,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:23,335 INFO L495 AbstractCegarLoop]: Abstraction has 5808 states and 8282 transitions. [2022-11-20 12:13:23,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:13:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand 5808 states and 8282 transitions. [2022-11-20 12:13:23,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-20 12:13:23,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:23,352 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:23,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-20 12:13:23,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-20 12:13:23,552 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:23,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash -961227544, now seen corresponding path program 1 times [2022-11-20 12:13:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:23,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467616270] [2022-11-20 12:13:23,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:23,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:23,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:23,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 12:13:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:23,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:13:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:23,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 12:13:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:23,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:13:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:23,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 12:13:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:23,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 12:13:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:23,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 12:13:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:23,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 12:13:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:23,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 12:13:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-20 12:13:23,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:23,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467616270] [2022-11-20 12:13:23,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467616270] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:13:23,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697725047] [2022-11-20 12:13:23,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:23,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:23,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:13:23,739 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:13:23,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-20 12:13:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:23,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:13:23,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:13:24,103 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-20 12:13:24,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:13:24,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697725047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:24,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:13:24,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-20 12:13:24,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689769976] [2022-11-20 12:13:24,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:24,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:13:24,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:24,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:13:24,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:13:24,106 INFO L87 Difference]: Start difference. First operand 5808 states and 8282 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:13:24,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:24,892 INFO L93 Difference]: Finished difference Result 11110 states and 15539 transitions. [2022-11-20 12:13:24,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:13:24,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 116 [2022-11-20 12:13:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:24,915 INFO L225 Difference]: With dead ends: 11110 [2022-11-20 12:13:24,916 INFO L226 Difference]: Without dead ends: 5496 [2022-11-20 12:13:24,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:13:24,930 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 2 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:13:24,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 446 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:13:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5496 states. [2022-11-20 12:13:25,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5496 to 5496. [2022-11-20 12:13:25,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5496 states, 4460 states have (on average 1.2643497757847533) internal successors, (5639), 4698 states have internal predecessors, (5639), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-11-20 12:13:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5496 states to 5496 states and 7528 transitions. [2022-11-20 12:13:25,561 INFO L78 Accepts]: Start accepts. Automaton has 5496 states and 7528 transitions. Word has length 116 [2022-11-20 12:13:25,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:25,561 INFO L495 AbstractCegarLoop]: Abstraction has 5496 states and 7528 transitions. [2022-11-20 12:13:25,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:13:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 5496 states and 7528 transitions. [2022-11-20 12:13:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-20 12:13:25,574 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:25,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] [2022-11-20 12:13:25,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-20 12:13:25,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-20 12:13:25,779 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:25,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:25,780 INFO L85 PathProgramCache]: Analyzing trace with hash 230421370, now seen corresponding path program 1 times [2022-11-20 12:13:25,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:25,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667816144] [2022-11-20 12:13:25,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:25,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:25,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:25,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 12:13:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:26,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:13:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:26,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:13:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:26,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:13:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:26,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-20 12:13:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:26,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 12:13:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:26,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 12:13:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:26,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 12:13:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:26,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-20 12:13:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:26,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-20 12:13:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-20 12:13:26,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:26,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667816144] [2022-11-20 12:13:26,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667816144] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:13:26,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875806313] [2022-11-20 12:13:26,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:26,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:26,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:13:26,041 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:13:26,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-20 12:13:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:26,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 12:13:26,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:13:26,222 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:13:26,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:13:26,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875806313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:26,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:13:26,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-11-20 12:13:26,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652220821] [2022-11-20 12:13:26,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:26,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:13:26,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:26,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:13:26,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:13:26,226 INFO L87 Difference]: Start difference. First operand 5496 states and 7528 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-20 12:13:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:27,028 INFO L93 Difference]: Finished difference Result 11630 states and 16840 transitions. [2022-11-20 12:13:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:13:27,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 131 [2022-11-20 12:13:27,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:27,066 INFO L225 Difference]: With dead ends: 11630 [2022-11-20 12:13:27,066 INFO L226 Difference]: Without dead ends: 6436 [2022-11-20 12:13:27,081 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 [2022-11-20 12:13:27,082 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 26 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:13:27,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 305 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:13:27,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6436 states. [2022-11-20 12:13:27,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6436 to 5544. [2022-11-20 12:13:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5544 states, 4508 states have (on average 1.2615350488021295) internal successors, (5687), 4746 states have internal predecessors, (5687), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-11-20 12:13:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7576 transitions. [2022-11-20 12:13:27,898 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7576 transitions. Word has length 131 [2022-11-20 12:13:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:27,899 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7576 transitions. [2022-11-20 12:13:27,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-20 12:13:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7576 transitions. [2022-11-20 12:13:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-20 12:13:27,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:27,917 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:27,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-20 12:13:28,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 12:13:28,124 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:28,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:28,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1879876967, now seen corresponding path program 1 times [2022-11-20 12:13:28,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:28,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219287971] [2022-11-20 12:13:28,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:28,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:28,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:28,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 12:13:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:28,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:13:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:28,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:13:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:28,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:13:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 12:13:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:28,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-20 12:13:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:28,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:13:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:28,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 12:13:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:28,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-20 12:13:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:28,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-20 12:13:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-20 12:13:28,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:28,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219287971] [2022-11-20 12:13:28,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219287971] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:13:28,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286075853] [2022-11-20 12:13:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:28,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:28,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:13:28,397 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:13:28,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-20 12:13:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:28,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:13:28,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:13:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:13:28,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:13:28,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286075853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:28,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:13:28,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-11-20 12:13:28,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251443048] [2022-11-20 12:13:28,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:28,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:13:28,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:28,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:13:28,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:13:28,581 INFO L87 Difference]: Start difference. First operand 5544 states and 7576 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-20 12:13:29,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:29,220 INFO L93 Difference]: Finished difference Result 11662 states and 16808 transitions. [2022-11-20 12:13:29,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:13:29,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 132 [2022-11-20 12:13:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:29,253 INFO L225 Difference]: With dead ends: 11662 [2022-11-20 12:13:29,253 INFO L226 Difference]: Without dead ends: 6420 [2022-11-20 12:13:29,268 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 [2022-11-20 12:13:29,270 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 30 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:13:29,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 310 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:13:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6420 states. [2022-11-20 12:13:29,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6420 to 5544. [2022-11-20 12:13:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5544 states, 4508 states have (on average 1.2508873114463177) internal successors, (5639), 4746 states have internal predecessors, (5639), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-11-20 12:13:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7528 transitions. [2022-11-20 12:13:29,969 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7528 transitions. Word has length 132 [2022-11-20 12:13:29,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:29,970 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7528 transitions. [2022-11-20 12:13:29,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-20 12:13:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7528 transitions. [2022-11-20 12:13:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-20 12:13:29,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:29,986 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:29,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-11-20 12:13:30,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:30,193 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:30,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:30,194 INFO L85 PathProgramCache]: Analyzing trace with hash 412574584, now seen corresponding path program 1 times [2022-11-20 12:13:30,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:30,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111155092] [2022-11-20 12:13:30,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:30,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:30,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:30,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 12:13:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:30,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:13:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:30,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:13:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:30,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:13:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:30,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 12:13:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:30,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-20 12:13:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:30,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:13:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:30,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 12:13:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:30,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-20 12:13:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:30,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-20 12:13:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-20 12:13:30,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:30,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111155092] [2022-11-20 12:13:30,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111155092] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:13:30,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089021629] [2022-11-20 12:13:30,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:30,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:30,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:13:30,434 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:13:30,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-20 12:13:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:30,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:13:30,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:13:30,819 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:13:30,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:13:30,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089021629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:30,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:13:30,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-11-20 12:13:30,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372933500] [2022-11-20 12:13:30,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:30,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:13:30,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:30,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:13:30,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:13:30,822 INFO L87 Difference]: Start difference. First operand 5544 states and 7528 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 12:13:31,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:31,531 INFO L93 Difference]: Finished difference Result 10786 states and 14542 transitions. [2022-11-20 12:13:31,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:13:31,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 132 [2022-11-20 12:13:31,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:31,552 INFO L225 Difference]: With dead ends: 10786 [2022-11-20 12:13:31,552 INFO L226 Difference]: Without dead ends: 5544 [2022-11-20 12:13:31,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:13:31,566 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 325 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:13:31,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 143 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:13:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5544 states. [2022-11-20 12:13:32,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5544 to 5544. [2022-11-20 12:13:32,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5544 states, 4508 states have (on average 1.247338065661047) internal successors, (5623), 4746 states have internal predecessors, (5623), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-11-20 12:13:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7512 transitions. [2022-11-20 12:13:32,430 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7512 transitions. Word has length 132 [2022-11-20 12:13:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:32,431 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7512 transitions. [2022-11-20 12:13:32,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 12:13:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7512 transitions. [2022-11-20 12:13:32,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-20 12:13:32,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:32,447 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:32,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-20 12:13:32,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-20 12:13:32,648 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:32,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:32,648 INFO L85 PathProgramCache]: Analyzing trace with hash -878588795, now seen corresponding path program 1 times [2022-11-20 12:13:32,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:32,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838456865] [2022-11-20 12:13:32,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:32,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:32,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:32,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 12:13:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:32,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:13:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:32,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:13:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:32,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:13:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:32,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 12:13:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:32,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 12:13:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:32,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-20 12:13:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:32,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 12:13:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:32,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-20 12:13:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:32,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-20 12:13:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-20 12:13:32,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:32,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838456865] [2022-11-20 12:13:32,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838456865] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:13:32,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280102505] [2022-11-20 12:13:32,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:32,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:32,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:13:32,942 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:13:32,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-20 12:13:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:33,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:13:33,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:13:33,131 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:13:33,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:13:33,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280102505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:33,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:13:33,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-20 12:13:33,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591154029] [2022-11-20 12:13:33,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:33,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:13:33,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:33,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:13:33,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:13:33,134 INFO L87 Difference]: Start difference. First operand 5544 states and 7512 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-20 12:13:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:33,797 INFO L93 Difference]: Finished difference Result 11822 states and 16920 transitions. [2022-11-20 12:13:33,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:13:33,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 133 [2022-11-20 12:13:33,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:33,820 INFO L225 Difference]: With dead ends: 11822 [2022-11-20 12:13:33,820 INFO L226 Difference]: Without dead ends: 6580 [2022-11-20 12:13:33,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:13:33,831 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 34 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:13:33,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 307 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:13:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2022-11-20 12:13:34,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 5656. [2022-11-20 12:13:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5656 states, 4620 states have (on average 1.2482683982683982) internal successors, (5767), 4858 states have internal predecessors, (5767), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-11-20 12:13:34,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 7656 transitions. [2022-11-20 12:13:34,444 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 7656 transitions. Word has length 133 [2022-11-20 12:13:34,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:34,445 INFO L495 AbstractCegarLoop]: Abstraction has 5656 states and 7656 transitions. [2022-11-20 12:13:34,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-20 12:13:34,446 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 7656 transitions. [2022-11-20 12:13:34,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-20 12:13:34,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:34,463 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:34,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-20 12:13:34,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 12:13:34,671 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:34,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:34,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1371214969, now seen corresponding path program 1 times [2022-11-20 12:13:34,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:34,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560601304] [2022-11-20 12:13:34,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:34,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:34,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:34,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 12:13:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:34,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:13:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:34,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:13:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:34,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:13:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:34,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 12:13:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:34,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 12:13:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:34,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-20 12:13:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:34,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 12:13:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:34,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-20 12:13:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:34,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-20 12:13:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:34,956 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-20 12:13:34,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:34,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560601304] [2022-11-20 12:13:34,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560601304] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:13:34,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143345092] [2022-11-20 12:13:34,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:34,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:34,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:13:34,959 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:13:34,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-20 12:13:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:35,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:13:35,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:13:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:13:35,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:13:35,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143345092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:35,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:13:35,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-11-20 12:13:35,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709215237] [2022-11-20 12:13:35,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:35,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:13:35,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:35,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:13:35,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:13:35,308 INFO L87 Difference]: Start difference. First operand 5656 states and 7656 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 12:13:35,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:35,976 INFO L93 Difference]: Finished difference Result 11010 states and 14798 transitions. [2022-11-20 12:13:35,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:13:35,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 133 [2022-11-20 12:13:35,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:35,992 INFO L225 Difference]: With dead ends: 11010 [2022-11-20 12:13:35,992 INFO L226 Difference]: Without dead ends: 5656 [2022-11-20 12:13:36,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:13:36,002 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 318 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:13:36,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 160 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:13:36,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5656 states. [2022-11-20 12:13:36,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5656 to 5656. [2022-11-20 12:13:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5656 states, 4620 states have (on average 1.2413419913419914) internal successors, (5735), 4858 states have internal predecessors, (5735), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-11-20 12:13:36,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 7624 transitions. [2022-11-20 12:13:36,695 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 7624 transitions. Word has length 133 [2022-11-20 12:13:36,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:36,695 INFO L495 AbstractCegarLoop]: Abstraction has 5656 states and 7624 transitions. [2022-11-20 12:13:36,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 12:13:36,696 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 7624 transitions. [2022-11-20 12:13:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-20 12:13:36,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:36,711 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:36,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-20 12:13:36,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 12:13:36,911 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:36,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:36,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1497129402, now seen corresponding path program 1 times [2022-11-20 12:13:36,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:36,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911898076] [2022-11-20 12:13:36,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:36,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:37,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:37,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 12:13:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:37,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:13:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:37,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:13:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:37,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:13:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:37,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 12:13:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:37,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 12:13:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:37,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 12:13:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:37,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-20 12:13:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:37,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 12:13:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:37,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-20 12:13:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-20 12:13:37,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:37,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911898076] [2022-11-20 12:13:37,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911898076] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:13:37,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899999071] [2022-11-20 12:13:37,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:37,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:37,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:13:37,191 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:13:37,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-20 12:13:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:37,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:13:37,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:13:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:13:37,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:13:37,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899999071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:37,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:13:37,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-11-20 12:13:37,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547981410] [2022-11-20 12:13:37,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:37,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:13:37,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:37,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:13:37,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:13:37,541 INFO L87 Difference]: Start difference. First operand 5656 states and 7624 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 12:13:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:38,316 INFO L93 Difference]: Finished difference Result 10898 states and 14606 transitions. [2022-11-20 12:13:38,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:13:38,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 134 [2022-11-20 12:13:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:38,331 INFO L225 Difference]: With dead ends: 10898 [2022-11-20 12:13:38,331 INFO L226 Difference]: Without dead ends: 5544 [2022-11-20 12:13:38,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:13:38,341 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 299 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:13:38,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 144 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:13:38,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5544 states. [2022-11-20 12:13:38,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5544 to 5544. [2022-11-20 12:13:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5544 states, 4508 states have (on average 1.236690328305235) internal successors, (5575), 4746 states have internal predecessors, (5575), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-11-20 12:13:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7464 transitions. [2022-11-20 12:13:39,006 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7464 transitions. Word has length 134 [2022-11-20 12:13:39,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:39,006 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7464 transitions. [2022-11-20 12:13:39,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 12:13:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7464 transitions. [2022-11-20 12:13:39,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-20 12:13:39,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:39,017 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:39,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-20 12:13:39,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:39,218 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:39,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:39,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1907659227, now seen corresponding path program 1 times [2022-11-20 12:13:39,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:39,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400360053] [2022-11-20 12:13:39,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:39,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:39,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:39,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 12:13:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:39,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:13:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:39,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:13:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:39,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:13:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:39,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 12:13:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:39,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:13:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:39,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 12:13:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:39,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-20 12:13:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:39,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-20 12:13:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:39,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-20 12:13:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-20 12:13:39,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:39,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400360053] [2022-11-20 12:13:39,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400360053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:39,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:13:39,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:13:39,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631023649] [2022-11-20 12:13:39,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:39,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:13:39,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:39,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:13:39,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:13:39,421 INFO L87 Difference]: Start difference. First operand 5544 states and 7464 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 12:13:40,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:40,997 INFO L93 Difference]: Finished difference Result 12062 states and 17168 transitions. [2022-11-20 12:13:40,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:13:40,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2022-11-20 12:13:40,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:41,028 INFO L225 Difference]: With dead ends: 12062 [2022-11-20 12:13:41,028 INFO L226 Difference]: Without dead ends: 6820 [2022-11-20 12:13:41,041 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 [2022-11-20 12:13:41,042 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 226 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:13:41,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 330 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 12:13:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6820 states. [2022-11-20 12:13:41,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6820 to 5656. [2022-11-20 12:13:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5656 states, 4604 states have (on average 1.2317549956559513) internal successors, (5671), 4858 states have internal predecessors, (5671), 469 states have call successors, (469), 313 states have call predecessors, (469), 582 states have return successors, (1428), 500 states have call predecessors, (1428), 469 states have call successors, (1428) [2022-11-20 12:13:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 7568 transitions. [2022-11-20 12:13:41,731 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 7568 transitions. Word has length 135 [2022-11-20 12:13:41,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:41,732 INFO L495 AbstractCegarLoop]: Abstraction has 5656 states and 7568 transitions. [2022-11-20 12:13:41,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 12:13:41,732 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 7568 transitions. [2022-11-20 12:13:41,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-20 12:13:41,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:41,743 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:41,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-20 12:13:41,743 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:41,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:41,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1853266329, now seen corresponding path program 1 times [2022-11-20 12:13:41,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:41,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264475466] [2022-11-20 12:13:41,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:41,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:41,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:41,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 12:13:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:41,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:13:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:41,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:13:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:41,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:13:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:41,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 12:13:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:41,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:13:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:41,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 12:13:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:41,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-20 12:13:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:41,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-20 12:13:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:41,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-20 12:13:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-20 12:13:41,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:41,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264475466] [2022-11-20 12:13:41,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264475466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:41,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:13:41,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:13:41,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702595718] [2022-11-20 12:13:41,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:41,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:13:41,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:41,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:13:41,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:13:41,942 INFO L87 Difference]: Start difference. First operand 5656 states and 7568 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 12:13:43,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:43,915 INFO L93 Difference]: Finished difference Result 13294 states and 18642 transitions. [2022-11-20 12:13:43,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 12:13:43,916 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2022-11-20 12:13:43,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:44,018 INFO L225 Difference]: With dead ends: 13294 [2022-11-20 12:13:44,018 INFO L226 Difference]: Without dead ends: 7940 [2022-11-20 12:13:44,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:13:44,026 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 297 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:13:44,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 417 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 12:13:44,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7940 states. [2022-11-20 12:13:44,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7940 to 7204. [2022-11-20 12:13:44,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7204 states, 5964 states have (on average 1.2459758551307847) internal successors, (7431), 6326 states have internal predecessors, (7431), 517 states have call successors, (517), 361 states have call predecessors, (517), 722 states have return successors, (2244), 532 states have call predecessors, (2244), 517 states have call successors, (2244) [2022-11-20 12:13:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7204 states to 7204 states and 10192 transitions. [2022-11-20 12:13:44,804 INFO L78 Accepts]: Start accepts. Automaton has 7204 states and 10192 transitions. Word has length 135 [2022-11-20 12:13:44,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:44,805 INFO L495 AbstractCegarLoop]: Abstraction has 7204 states and 10192 transitions. [2022-11-20 12:13:44,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 12:13:44,805 INFO L276 IsEmpty]: Start isEmpty. Operand 7204 states and 10192 transitions. [2022-11-20 12:13:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-20 12:13:44,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:44,816 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:44,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-20 12:13:44,816 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:44,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:44,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1576268195, now seen corresponding path program 1 times [2022-11-20 12:13:44,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:44,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836448661] [2022-11-20 12:13:44,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:44,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:44,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:44,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 12:13:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:45,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:13:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:45,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:13:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:45,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:13:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:45,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 12:13:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:45,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:13:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:45,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 12:13:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:45,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 12:13:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:45,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 12:13:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:45,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 12:13:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:45,055 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-20 12:13:45,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:45,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836448661] [2022-11-20 12:13:45,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836448661] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:13:45,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210890908] [2022-11-20 12:13:45,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:45,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:45,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:13:45,058 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:13:45,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-20 12:13:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:45,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 12:13:45,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:13:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 12:13:45,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:13:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-20 12:13:45,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210890908] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:13:45,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:13:45,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2022-11-20 12:13:45,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743264099] [2022-11-20 12:13:45,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:13:45,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 12:13:45,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:45,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 12:13:45,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:13:45,838 INFO L87 Difference]: Start difference. First operand 7204 states and 10192 transitions. Second operand has 13 states, 13 states have (on average 16.0) internal successors, (208), 10 states have internal predecessors, (208), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2022-11-20 12:13:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:49,667 INFO L93 Difference]: Finished difference Result 19309 states and 27520 transitions. [2022-11-20 12:13:49,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-20 12:13:49,667 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 16.0) internal successors, (208), 10 states have internal predecessors, (208), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 138 [2022-11-20 12:13:49,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:49,697 INFO L225 Difference]: With dead ends: 19309 [2022-11-20 12:13:49,697 INFO L226 Difference]: Without dead ends: 12287 [2022-11-20 12:13:49,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 308 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=473, Invalid=1689, Unknown=0, NotChecked=0, Total=2162 [2022-11-20 12:13:49,712 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 1637 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:13:49,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 401 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-20 12:13:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12287 states. [2022-11-20 12:13:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12287 to 11183. [2022-11-20 12:13:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11183 states, 9459 states have (on average 1.2225393804841949) internal successors, (11564), 9951 states have internal predecessors, (11564), 675 states have call successors, (675), 565 states have call predecessors, (675), 1048 states have return successors, (2589), 674 states have call predecessors, (2589), 675 states have call successors, (2589) [2022-11-20 12:13:51,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11183 states to 11183 states and 14828 transitions. [2022-11-20 12:13:51,036 INFO L78 Accepts]: Start accepts. Automaton has 11183 states and 14828 transitions. Word has length 138 [2022-11-20 12:13:51,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:51,037 INFO L495 AbstractCegarLoop]: Abstraction has 11183 states and 14828 transitions. [2022-11-20 12:13:51,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.0) internal successors, (208), 10 states have internal predecessors, (208), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2022-11-20 12:13:51,037 INFO L276 IsEmpty]: Start isEmpty. Operand 11183 states and 14828 transitions. [2022-11-20 12:13:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-20 12:13:51,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:13:51,047 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:51,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-20 12:13:51,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-20 12:13:51,247 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:13:51,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:51,248 INFO L85 PathProgramCache]: Analyzing trace with hash 700165149, now seen corresponding path program 1 times [2022-11-20 12:13:51,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:51,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354639876] [2022-11-20 12:13:51,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:51,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:51,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:13:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:51,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 12:13:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:51,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:13:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:51,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:13:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:51,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:13:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:51,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 12:13:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:51,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:13:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:51,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 12:13:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:51,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 12:13:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:51,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 12:13:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:51,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 12:13:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-20 12:13:51,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:51,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354639876] [2022-11-20 12:13:51,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354639876] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:13:51,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354516033] [2022-11-20 12:13:51,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:51,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:13:51,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:13:51,536 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:13:51,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-20 12:13:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:51,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:13:51,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:13:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:13:51,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:13:51,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354516033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:51,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:13:51,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-11-20 12:13:51,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820990946] [2022-11-20 12:13:51,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:51,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:13:51,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:51,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:13:51,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:13:51,851 INFO L87 Difference]: Start difference. First operand 11183 states and 14828 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 12:13:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:13:52,472 INFO L93 Difference]: Finished difference Result 14412 states and 18889 transitions. [2022-11-20 12:13:52,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:13:52,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 138 [2022-11-20 12:13:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:13:52,475 INFO L225 Difference]: With dead ends: 14412 [2022-11-20 12:13:52,475 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 12:13:52,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:13:52,494 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 208 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:13:52,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 170 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:13:52,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 12:13:52,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 12:13:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:13:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 12:13:52,496 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2022-11-20 12:13:52,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:13:52,496 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 12:13:52,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 12:13:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 12:13:52,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 12:13:52,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 12:13:52,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-20 12:13:52,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-20 12:13:52,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 12:14:23,272 WARN L233 SmtUtils]: Spent 11.68s on a formula simplification. DAG size of input: 845 DAG size of output: 39 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-20 12:14:40,973 WARN L233 SmtUtils]: Spent 14.62s on a formula simplification. DAG size of input: 989 DAG size of output: 88 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-20 12:14:53,189 WARN L233 SmtUtils]: Spent 7.19s on a formula simplification. DAG size of input: 341 DAG size of output: 155 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-20 12:15:10,902 WARN L233 SmtUtils]: Spent 9.57s on a formula simplification. DAG size of input: 584 DAG size of output: 164 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-20 12:15:21,917 WARN L233 SmtUtils]: Spent 11.00s on a formula simplification. DAG size of input: 529 DAG size of output: 163 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-20 12:15:40,452 WARN L233 SmtUtils]: Spent 5.04s on a formula simplification. DAG size of input: 228 DAG size of output: 150 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-20 12:15:49,336 INFO L895 garLoopResultBuilder]: At program point L129(lines 106 131) the Hoare annotation is: (let ((.cse14 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|)) (.cse0 (not (<= ~comp_m1_i~0 0))) (.cse1 (not (<= 1 ~d1_val_t~0))) (.cse2 (not (<= 1 ~d0_val_t~0))) (.cse3 (not (<= 2 ~b0_ev~0))) (.cse4 (not (= ~z_val~0 ~z_val_t~0))) (.cse5 (not (<= 2 ~z_ev~0))) (.cse6 (not (= ~z_val~0 0))) (.cse7 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse8 (not (<= ~d0_val_t~0 ~d0_val~0))) (.cse9 (not (<= 1 ~b0_val_t~0))) (.cse10 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse11 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse12 (not (<= 1 ~b1_val_t~0))) (.cse13 (<= 1 |activate_threads_is_method1_triggered_~__retres1~0#1|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~b1_ev~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (not (= ~d1_ev~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse4 (not (= ~b0_ev~0 1)) .cse5 .cse6 (and .cse14 .cse13) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 (not (= ~d0_ev~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-11-20 12:15:49,336 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2022-11-20 12:15:49,336 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 125) no Hoare annotation was computed. [2022-11-20 12:15:49,336 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2022-11-20 12:15:49,337 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 383 398) the Hoare annotation is: (let ((.cse0 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|)) (.cse1 (not (<= ~comp_m1_i~0 0))) (.cse2 (not (<= 1 ~d1_val_t~0))) (.cse3 (not (<= 1 ~d0_val_t~0))) (.cse4 (not (= ~z_val~0 ~z_val_t~0))) (.cse5 (not (<= 2 ~z_ev~0))) (.cse6 (not (= ~z_val~0 0))) (.cse7 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse8 (not (<= ~d0_val_t~0 ~d0_val~0))) (.cse9 (not (<= 1 ~b0_val_t~0))) (.cse10 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse11 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse12 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~b0_ev~0 1)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 (not (<= 2 ~b0_ev~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-11-20 12:15:49,337 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 127) no Hoare annotation was computed. [2022-11-20 12:15:49,337 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 383 398) no Hoare annotation was computed. [2022-11-20 12:15:49,338 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2022-11-20 12:15:49,338 INFO L899 garLoopResultBuilder]: For program point L390-2(lines 383 398) no Hoare annotation was computed. [2022-11-20 12:15:49,338 INFO L895 garLoopResultBuilder]: At program point L130(lines 103 132) the Hoare annotation is: (let ((.cse15 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|)) (.cse16 (<= 1 |activate_threads_is_method1_triggered_#res#1|)) (.cse17 (<= 1 |activate_threads_is_method1_triggered_~__retres1~0#1|))) (let ((.cse5 (and .cse15 .cse16 .cse17)) (.cse13 (and .cse16 .cse17)) (.cse0 (not (<= ~comp_m1_i~0 0))) (.cse1 (not (<= 1 ~d1_val_t~0))) (.cse2 (not (<= 1 ~d0_val_t~0))) (.cse14 (not (<= 2 ~b0_ev~0))) (.cse3 (not (= ~z_val~0 ~z_val_t~0))) (.cse4 (not (<= 2 ~z_ev~0))) (.cse6 (not (= ~z_val~0 0))) (.cse7 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse8 (not (<= ~d0_val_t~0 ~d0_val~0))) (.cse9 (not (<= 1 ~b0_val_t~0))) (.cse10 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse11 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse12 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~b0_ev~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse0 .cse1 .cse2 .cse14 (not (= ~d0_ev~0 1)) .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse15 .cse0 .cse1 .cse2 .cse14 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (not (= ~d1_ev~0 1)) .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse0 .cse1 .cse2 .cse14 .cse3 .cse4 (not (= ~b1_ev~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-11-20 12:15:49,338 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 264 278) no Hoare annotation was computed. [2022-11-20 12:15:49,339 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 273) no Hoare annotation was computed. [2022-11-20 12:15:49,339 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 264 278) the Hoare annotation is: true [2022-11-20 12:15:49,339 INFO L895 garLoopResultBuilder]: At program point L275(lines 267 277) the Hoare annotation is: (let ((.cse2 (not (<= ~d1_ev~0 0))) (.cse19 (not (<= 2 ~b1_ev~0))) (.cse20 (not (<= ~d0_ev~0 0))) (.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (<= ~comp_m1_i~0 0))) (.cse3 (not (<= 1 ~d1_val_t~0))) (.cse4 (not (<= 1 ~d0_val_t~0))) (.cse5 (not (<= 2 ~b0_ev~0))) (.cse6 (not (= ~z_val~0 ~z_val_t~0))) (.cse7 (not (<= 2 ~z_ev~0))) (.cse8 (not (= ~z_val~0 0))) (.cse18 (not (<= 2 ~d1_ev~0))) (.cse9 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse10 (not (<= ~d0_val_t~0 ~d0_val~0))) (.cse11 (not (<= 1 ~b0_val_t~0))) (.cse12 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse13 (<= 1 exists_runnable_thread_~__retres1~1)) (.cse14 (not (<= ~b1_ev~0 0))) (.cse15 (not (<= 2 ~d0_ev~0))) (.cse16 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse17 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse16 .cse20 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse20 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse20 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse16 .cse20 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2022-11-20 12:15:49,340 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 264 278) no Hoare annotation was computed. [2022-11-20 12:15:49,341 INFO L895 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 317 349) the Hoare annotation is: (let ((.cse22 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse23 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse24 (= |old(~z_ev~0)| ~z_ev~0)) (.cse25 (= |old(~b1_ev~0)| ~b1_ev~0))) (let ((.cse17 (not (<= |old(~d1_ev~0)| 0))) (.cse1 (not (= |old(~b0_ev~0)| 0))) (.cse8 (not (<= |old(~b1_ev~0)| 0))) (.cse20 (not (<= |old(~d0_ev~0)| 0))) (.cse14 (and .cse22 .cse23 .cse24 (= ~b0_ev~0 0) .cse25)) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse2 (not (<= ~comp_m1_i~0 0))) (.cse3 (not (<= 1 ~d1_val_t~0))) (.cse4 (not (<= 1 ~d0_val_t~0))) (.cse5 (not (<= 2 |old(~d1_ev~0)|))) (.cse6 (not (= ~z_val~0 ~z_val_t~0))) (.cse18 (and .cse22 (= ~b0_ev~0 |old(~b0_ev~0)|) .cse23 .cse24 .cse25)) (.cse7 (not (= ~z_val~0 0))) (.cse19 (not (<= 2 |old(~b1_ev~0)|))) (.cse9 (not (<= 2 |old(~d0_ev~0)|))) (.cse10 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse11 (not (<= ~d0_val_t~0 ~d0_val~0))) (.cse12 (not (<= 1 ~b0_val_t~0))) (.cse13 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse15 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse21 (not (<= 2 |old(~b0_ev~0)|))) (.cse16 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse17 .cse6 .cse18 .cse7 .cse19 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse21 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse19 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse17 .cse6 .cse18 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse21 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse17 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse21 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse17 .cse6 .cse18 .cse7 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse21 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse19 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse21 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse21 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse21 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse21 .cse16)))) [2022-11-20 12:15:49,341 INFO L899 garLoopResultBuilder]: For program point L341-1(lines 317 349) no Hoare annotation was computed. [2022-11-20 12:15:49,341 INFO L899 garLoopResultBuilder]: For program point L331-1(lines 320 348) no Hoare annotation was computed. [2022-11-20 12:15:49,341 INFO L899 garLoopResultBuilder]: For program point L321-1(lines 320 348) no Hoare annotation was computed. [2022-11-20 12:15:49,341 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 317 349) no Hoare annotation was computed. [2022-11-20 12:15:49,342 INFO L899 garLoopResultBuilder]: For program point L336-1(lines 320 348) no Hoare annotation was computed. [2022-11-20 12:15:49,342 INFO L899 garLoopResultBuilder]: For program point L326-1(lines 320 348) no Hoare annotation was computed. [2022-11-20 12:15:49,343 INFO L895 garLoopResultBuilder]: At program point L205(lines 193 207) the Hoare annotation is: (let ((.cse52 (<= ~d1_ev~0 0)) (.cse35 (<= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse37 (<= 2 ~d0_ev~0)) (.cse39 (<= |old(~d0_ev~0)| ~d0_ev~0)) (.cse54 (<= ~b1_ev~0 0)) (.cse32 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse27 (<= ~comp_m1_i~0 0)) (.cse57 (= ~z_val~0 ~z_val_t~0)) (.cse28 (<= 2 ~z_ev~0)) (.cse29 (<= 2 ~b1_ev~0)) (.cse53 (<= ~d0_ev~0 0)) (.cse58 (= |old(~z_val~0)| ~z_val~0)) (.cse30 (<= ~d0_val_t~0 ~d0_val~0)) (.cse31 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse59 (<= 1 ~d0_val_t~0)) (.cse56 (<= 1 ~b0_val_t~0)) (.cse33 (<= |old(~b1_ev~0)| ~b1_ev~0)) (.cse34 (<= 2 ~d1_ev~0)) (.cse36 (<= ~b1_val_t~0 ~b1_val~0)) (.cse38 (<= ~b0_val_t~0 ~b0_val~0)) (.cse55 (<= 1 ~b1_val_t~0)) (.cse40 (= ~z_val~0 0)) (.cse45 (<= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse41 (<= ~d1_val_t~0 ~d1_val~0)) (.cse60 (<= 1 ~d1_val_t~0)) (.cse42 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse46 (= ~b0_ev~0 0)) (.cse47 (<= ~b1_ev~0 |old(~b1_ev~0)|))) (let ((.cse10 (and .cse27 .cse57 .cse28 .cse29 .cse53 .cse58 .cse30 .cse31 .cse59 .cse56 .cse33 .cse34 .cse36 .cse38 .cse55 .cse40 .cse45 .cse41 .cse60 .cse42 .cse46 .cse47)) (.cse22 (and .cse27 .cse57 .cse28 .cse29 .cse53 .cse58 .cse30 .cse31 .cse59 .cse32 .cse33 .cse34 .cse36 .cse38 .cse40 .cse45 .cse41 .cse60 .cse42 .cse47)) (.cse2 (and .cse27 .cse57 .cse28 .cse54 .cse53 .cse58 .cse30 .cse31 .cse59 .cse34 .cse36 .cse38 .cse40 .cse45 .cse41 .cse60 .cse42 .cse46)) (.cse25 (and .cse27 .cse28 .cse54 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse45 .cse41 .cse42)) (.cse12 (and .cse27 .cse57 .cse28 .cse54 .cse53 .cse58 .cse30 .cse31 .cse59 .cse32 .cse34 .cse36 .cse38 .cse40 .cse45 .cse41 .cse60 .cse42)) (.cse44 (and .cse27 .cse57 .cse28 .cse54 .cse58 .cse30 .cse31 .cse59 .cse56 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse45 .cse41 .cse60 .cse42 .cse46)) (.cse5 (not (<= 2 |old(~d1_ev~0)|))) (.cse24 (and .cse27 .cse57 .cse28 .cse29 .cse30 .cse52 .cse31 .cse59 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse60 .cse47)) (.cse26 (and .cse27 .cse57 .cse28 .cse54 .cse58 .cse30 .cse52 .cse31 .cse59 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse60 .cse46)) (.cse11 (not (<= 2 |old(~b1_ev~0)|))) (.cse43 (not (<= 2 |old(~d0_ev~0)|))) (.cse13 (and .cse27 .cse28 .cse29 .cse53 .cse30 .cse52 .cse31 .cse32 .cse33 .cse36 .cse38 .cse40 .cse41 .cse47)) (.cse15 (and .cse27 .cse57 .cse28 .cse29 .cse53 .cse58 .cse30 .cse52 .cse31 .cse59 .cse56 .cse33 .cse36 .cse38 .cse40 .cse41 .cse60 .cse46 .cse47)) (.cse48 (and .cse27 .cse57 .cse28 .cse54 .cse58 .cse30 .cse52 .cse31 .cse59 .cse32 .cse56 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse60)) (.cse49 (and .cse27 .cse57 .cse28 .cse29 .cse58 .cse30 .cse52 .cse31 .cse59 .cse56 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse60 .cse46 .cse47)) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse1 (not .cse27)) (.cse3 (not .cse60)) (.cse4 (not .cse59)) (.cse50 (not (<= |old(~d1_ev~0)| 0))) (.cse6 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse7 (not (= |old(~z_val~0)| 0))) (.cse8 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse9 (and .cse27 .cse57 .cse28 .cse54 .cse53 .cse58 .cse30 .cse52 .cse31 .cse59 .cse56 .cse36 .cse38 .cse40 .cse41 .cse60 .cse46)) (.cse51 (not (<= |old(~b1_ev~0)| 0))) (.cse14 (not .cse56)) (.cse16 (not (<= |old(~d0_ev~0)| 0))) (.cse17 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse18 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse19 (not (<= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse20 (not (<= 2 |old(~b0_ev~0)|))) (.cse21 (and .cse27 .cse28 .cse54 .cse53 .cse30 .cse52 .cse31 .cse32 .cse36 .cse38 .cse40 .cse41)) (.cse23 (not .cse55))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse7 .cse8 .cse26 .cse9 (and .cse27 .cse28 (= ~d1_ev~0 |old(~d1_ev~0)|) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (= |old(~z_ev~0)| ~z_ev~0) .cse41 .cse42 (= |old(~b1_ev~0)| ~b1_ev~0)) .cse10 .cse11 .cse43 .cse12 .cse13 .cse14 .cse44 .cse15 (and .cse27 .cse28 .cse29 .cse30 .cse31 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse45 .cse41 .cse42 .cse46 .cse47) .cse17 .cse18 .cse48 .cse49 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse3 .cse4 .cse50 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse51 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse7 .cse8 .cse26 .cse9 .cse51 .cse43 .cse12 .cse14 .cse44 .cse17 .cse18 .cse48 .cse19 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse3 .cse4 .cse50 .cse6 .cse7 .cse8 .cse26 .cse9 .cse51 .cse43 .cse14 .cse17 .cse18 .cse48 .cse19 .cse20 .cse21 .cse23) (or (not (= ~comp_m1_st~0 0)) .cse0 .cse1 (and .cse30 .cse52 .cse31 .cse33 .cse35 .cse36 .cse38 .cse39 .cse40 .cse41 .cse46 .cse47) (and .cse53 .cse30 .cse31 .cse33 .cse36 .cse38 .cse40 .cse45 .cse41 .cse42 .cse46 .cse47) .cse3 .cse4 (and .cse53 .cse30 .cse52 .cse31 .cse33 .cse36 .cse38 .cse40 .cse41 .cse46 .cse47) (and .cse30 .cse31 .cse33 .cse35 .cse36 .cse38 .cse39 .cse40 .cse45 .cse41 .cse42 .cse46 .cse47) .cse5 .cse6 (not (= |old(~d0_req_up~0)| 1)) .cse7 (and .cse54 .cse53 .cse30 .cse31 .cse36 .cse38 .cse40 .cse45 .cse41 .cse42 .cse46) (and .cse54 .cse30 .cse52 .cse31 .cse35 .cse36 .cse38 .cse39 .cse40 .cse41 .cse46) .cse11 .cse43 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (and .cse54 .cse53 .cse30 .cse52 .cse31 .cse36 .cse38 .cse40 .cse41 .cse46) (not (= |old(~b1_req_up~0)| 1)) .cse20 (and .cse54 .cse30 .cse31 .cse35 .cse36 .cse38 .cse39 .cse40 .cse45 .cse41 .cse42 .cse46) .cse23) (or .cse0 .cse1 .cse3 .cse4 .cse50 .cse6 .cse24 .cse7 .cse8 .cse26 .cse9 .cse11 .cse43 .cse13 .cse14 .cse15 .cse17 .cse18 .cse48 .cse49 .cse19 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse3 .cse4 .cse50 .cse6 .cse7 .cse8 .cse9 .cse51 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23)))) [2022-11-20 12:15:49,343 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2022-11-20 12:15:49,344 INFO L899 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2022-11-20 12:15:49,344 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 211 249) no Hoare annotation was computed. [2022-11-20 12:15:49,345 INFO L895 garLoopResultBuilder]: At program point L160(lines 148 162) the Hoare annotation is: (let ((.cse40 (<= |old(~b1_ev~0)| ~b1_ev~0)) (.cse41 (<= ~b1_ev~0 |old(~b1_ev~0)|)) (.cse52 (<= 2 ~d1_ev~0)) (.cse55 (<= 2 ~b0_ev~0)) (.cse46 (= ~z_val~0 ~z_val_t~0)) (.cse48 (= |old(~z_val~0)| ~z_val~0)) (.cse57 (<= ~d1_ev~0 0)) (.cse50 (<= 1 ~d0_val_t~0)) (.cse44 (<= 1 ~b0_val_t~0)) (.cse56 (<= 1 ~d1_val_t~0)) (.cse38 (= ~b0_ev~0 0)) (.cse45 (<= ~comp_m1_i~0 0)) (.cse47 (<= 2 ~z_ev~0)) (.cse27 (<= ~b1_ev~0 0)) (.cse49 (<= ~d0_val_t~0 ~d0_val~0)) (.cse28 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse51 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse29 (<= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse30 (<= ~b1_val_t~0 ~b1_val~0)) (.cse31 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse53 (<= 2 ~d0_ev~0)) (.cse32 (<= ~b0_val_t~0 ~b0_val~0)) (.cse33 (<= |old(~d0_ev~0)| ~d0_ev~0)) (.cse34 (= ~z_val~0 0)) (.cse35 (<= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse54 (<= ~d1_val_t~0 ~d1_val~0)) (.cse36 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse37 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse39 (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (let ((.cse18 (and .cse45 .cse47 .cse27 .cse49 .cse28 .cse51 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse37 .cse39)) (.cse20 (and .cse45 .cse46 .cse47 .cse27 .cse48 .cse49 .cse57 .cse28 .cse50 .cse44 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse56 .cse37 .cse38 .cse39)) (.cse24 (and .cse45 .cse46 .cse47 .cse27 (<= ~d0_ev~0 0) .cse48 .cse49 .cse28 .cse50 .cse51 .cse44 .cse52 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse54 .cse55 .cse36 .cse56 .cse37 .cse39)) (.cse26 (and .cse45 .cse46 .cse47 .cse27 .cse49 .cse28 .cse50 .cse52 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse56 .cse37 .cse38 .cse39)) (.cse4 (not (<= |old(~d1_ev~0)| 0))) (.cse22 (and .cse49 .cse28 .cse40 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse37 .cse38 .cse39 .cse41)) (.cse9 (and .cse45 .cse46 .cse47 .cse27 .cse48 .cse49 .cse57 .cse28 .cse50 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse56 .cse37 .cse38 .cse39)) (.cse23 (not (<= 2 |old(~b1_ev~0)|))) (.cse11 (not (<= |old(~d0_ev~0)| 0))) (.cse25 (and (= ~d1_ev~0 |old(~d1_ev~0)|) .cse49 .cse51 .cse30 .cse31 .cse32 (= |old(~d0_ev~0)| ~d0_ev~0) .cse34 (= |old(~z_ev~0)| ~z_ev~0) .cse54 .cse36 (= |old(~b1_ev~0)| ~b1_ev~0) .cse39)) (.cse17 (and .cse45 .cse46 .cse47 .cse27 .cse48 .cse49 .cse57 .cse28 .cse50 .cse51 .cse44 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse56 .cse37 .cse39)) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse1 (not .cse45)) (.cse42 (and .cse45 .cse47 .cse27 .cse49 .cse28 .cse52 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse37 .cse38 .cse39)) (.cse2 (not .cse56)) (.cse3 (not .cse50)) (.cse21 (not (<= 2 |old(~d1_ev~0)|))) (.cse5 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse6 (not (= |old(~z_val~0)| 0))) (.cse7 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse8 (not (<= |old(~b1_ev~0)| 0))) (.cse19 (not (<= 2 |old(~d0_ev~0)|))) (.cse43 (and .cse45 .cse46 .cse47 .cse27 .cse48 .cse49 .cse28 .cse50 .cse51 .cse44 .cse52 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse54 .cse55 .cse36 .cse56 .cse37 .cse39)) (.cse10 (not .cse44)) (.cse12 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse13 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse14 (not (<= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse15 (not (<= 2 |old(~b0_ev~0)|))) (.cse16 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse10 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse22 .cse23 .cse10 .cse24 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse26 .cse16) (or (not (= ~comp_m1_st~0 0)) .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 (not (= |old(~d0_req_up~0)| 1)) .cse6 .cse23 .cse19 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (and .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) (not (= |old(~b1_req_up~0)| 1)) .cse15 (and .cse28 .cse40 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse41) .cse16) (or .cse0 .cse1 .cse42 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse22 .cse23 .cse19 .cse43 .cse10 .cse12 .cse13 .cse25 .cse14 .cse15 .cse16) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse22 .cse23 .cse19 .cse10 .cse20 .cse12 .cse13 .cse25 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse22 .cse9 .cse23 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse42 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse19 .cse43 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2022-11-20 12:15:49,346 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 157) no Hoare annotation was computed. [2022-11-20 12:15:49,346 INFO L899 garLoopResultBuilder]: For program point L152-2(lines 152 157) no Hoare annotation was computed. [2022-11-20 12:15:49,347 INFO L895 garLoopResultBuilder]: At program point update_channelsENTRY(lines 208 250) the Hoare annotation is: (let ((.cse20 (= |old(~d1_val~0)| ~d1_val~0)) (.cse21 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse22 (= ~b0_req_up~0 |old(~b0_req_up~0)|)) (.cse23 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse24 (= ~b1_val~0 |old(~b1_val~0)|)) (.cse25 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse26 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse27 (= ~z_val~0 0)) (.cse28 (= |old(~z_ev~0)| ~z_ev~0)) (.cse29 (= |old(~d0_val~0)| ~d0_val~0)) (.cse30 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse31 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse32 (= |old(~b0_val~0)| ~b0_val~0)) (.cse33 (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (let ((.cse11 (not (<= |old(~d0_ev~0)| 0))) (.cse3 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (= |old(~b1_req_up~0)| ~b1_req_up~0) .cse30 .cse31 .cse32 .cse33)) (.cse5 (not (<= |old(~d1_ev~0)| 0))) (.cse8 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse18 (not (<= |old(~b1_ev~0)| 0))) (.cse10 (not (<= 1 ~b0_val_t~0))) (.cse12 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse13 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse14 (not (<= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse1 (not (<= ~comp_m1_i~0 0))) (.cse2 (not (<= 1 ~d1_val_t~0))) (.cse4 (not (<= 1 ~d0_val_t~0))) (.cse17 (not (<= 2 |old(~d1_ev~0)|))) (.cse6 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse7 (not (= |old(~z_val~0)| 0))) (.cse9 (not (<= 2 |old(~b1_ev~0)|))) (.cse19 (not (<= 2 |old(~d0_ev~0)|))) (.cse15 (not (<= 2 |old(~b0_ev~0)|))) (.cse16 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse18 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (or (not (= ~comp_m1_st~0 0)) .cse0 .cse1 .cse2 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (= 1 ~b1_req_up~0) .cse32 .cse33) .cse4 .cse17 .cse6 (not (= |old(~d0_req_up~0)| 1)) .cse7 .cse9 .cse19 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (not (= |old(~b1_req_up~0)| 1)) .cse15 .cse16)))) [2022-11-20 12:15:49,347 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 208 250) no Hoare annotation was computed. [2022-11-20 12:15:49,348 INFO L895 garLoopResultBuilder]: At program point L190(lines 178 192) the Hoare annotation is: (let ((.cse52 (<= 1 ~b1_val_t~0)) (.cse47 (<= ~b1_ev~0 0)) (.cse42 (<= ~d1_ev~0 0)) (.cse58 (<= 1 ~b0_val_t~0)) (.cse50 (<= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse61 (<= 2 ~d0_ev~0)) (.cse51 (<= |old(~d0_ev~0)| ~d0_ev~0)) (.cse45 (= ~b0_ev~0 0)) (.cse53 (<= ~comp_m1_i~0 0)) (.cse54 (= ~z_val~0 ~z_val_t~0)) (.cse55 (<= 2 ~z_ev~0)) (.cse62 (<= 2 ~b1_ev~0)) (.cse41 (<= ~d0_ev~0 0)) (.cse56 (= |old(~z_val~0)| ~z_val~0)) (.cse32 (<= ~d0_val_t~0 ~d0_val~0)) (.cse43 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse57 (<= 1 ~d0_val_t~0)) (.cse33 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse44 (<= |old(~b1_ev~0)| ~b1_ev~0)) (.cse59 (<= 2 ~d1_ev~0)) (.cse34 (<= ~b1_val_t~0 ~b1_val~0)) (.cse35 (<= ~b0_val_t~0 ~b0_val~0)) (.cse36 (= ~z_val~0 0)) (.cse48 (<= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse37 (<= ~d1_val_t~0 ~d1_val~0)) (.cse38 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse60 (<= 1 ~d1_val_t~0)) (.cse49 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse46 (<= ~b1_ev~0 |old(~b1_ev~0)|))) (let ((.cse21 (and .cse53 .cse54 .cse55 .cse62 .cse41 .cse56 .cse32 .cse43 .cse57 .cse33 .cse44 .cse59 .cse34 .cse35 .cse36 .cse48 .cse37 .cse38 .cse60 .cse49 .cse46)) (.cse22 (and .cse53 .cse55 .cse62 .cse41 .cse32 .cse43 .cse44 .cse59 .cse34 .cse35 .cse36 .cse48 .cse37 .cse38 .cse60 .cse49 .cse45 .cse46)) (.cse26 (and .cse53 .cse54 .cse55 .cse62 .cse56 .cse32 .cse42 .cse43 .cse57 .cse33 .cse58 .cse44 .cse50 .cse34 .cse61 .cse35 .cse51 .cse36 .cse37 .cse38 .cse60 .cse46)) (.cse28 (and .cse53 .cse54 .cse55 .cse62 .cse32 .cse42 .cse43 .cse57 .cse44 .cse50 .cse34 .cse61 .cse35 .cse51 .cse36 .cse37 .cse38 .cse60 .cse45 .cse46)) (.cse18 (and .cse53 .cse54 .cse55 .cse62 .cse41 .cse56 .cse32 .cse42 .cse43 .cse57 .cse33 .cse44 .cse34 .cse35 .cse36 .cse37 .cse38 .cse60 .cse46)) (.cse20 (and .cse53 .cse54 .cse55 .cse62 .cse41 .cse56 .cse32 .cse42 .cse43 .cse57 .cse44 .cse34 .cse35 .cse36 .cse37 .cse38 .cse60 .cse45 .cse46)) (.cse5 (not (<= |old(~d1_ev~0)| 0))) (.cse19 (not (<= 2 |old(~b1_ev~0)|))) (.cse40 (and .cse32 .cse43 .cse44 .cse50 .cse34 .cse35 .cse51 .cse36 .cse48 .cse37 .cse38 .cse49 .cse45 .cse46)) (.cse12 (not (<= |old(~d0_ev~0)| 0))) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse1 (and .cse53 .cse54 .cse55 .cse47 .cse41 .cse56 .cse32 .cse42 .cse43 .cse57 .cse58 .cse34 .cse35 .cse36 .cse37 .cse38 .cse60 .cse45)) (.cse2 (not .cse53)) (.cse3 (not .cse60)) (.cse4 (not .cse57)) (.cse23 (not (<= 2 |old(~d1_ev~0)|))) (.cse6 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse31 (and .cse53 .cse54 .cse55 .cse47 .cse56 .cse32 .cse43 .cse57 .cse33 .cse59 .cse50 .cse34 .cse35 .cse51 .cse36 .cse48 .cse37 .cse38 .cse60 .cse49)) (.cse27 (and .cse53 .cse54 .cse55 .cse47 .cse56 .cse32 .cse42 .cse43 .cse57 .cse58 .cse50 .cse34 .cse61 .cse35 .cse51 .cse36 .cse37 .cse38 .cse60 .cse45)) (.cse7 (not (= |old(~z_val~0)| 0))) (.cse8 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse29 (and .cse53 .cse54 .cse55 .cse47 .cse56 .cse32 .cse42 .cse43 .cse57 .cse33 .cse58 .cse50 .cse34 .cse61 .cse35 .cse51 .cse36 .cse37 (<= 2 ~b0_ev~0) .cse38 .cse60)) (.cse9 (not (<= |old(~b1_ev~0)| 0))) (.cse39 (and .cse53 .cse54 .cse55 .cse47 .cse32 .cse43 .cse57 .cse59 .cse50 .cse34 .cse35 .cse51 .cse36 .cse48 .cse37 .cse38 .cse60 .cse49 .cse45)) (.cse10 (and .cse53 .cse55 .cse47 .cse41 .cse32 .cse42 .cse43 .cse57 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse60)) (.cse30 (not (<= 2 |old(~d0_ev~0)|))) (.cse11 (not .cse58)) (.cse24 (and .cse53 .cse54 .cse55 .cse47 .cse41 .cse56 .cse32 .cse43 .cse57 .cse33 .cse58 .cse59 .cse34 .cse35 .cse36 .cse48 .cse37 .cse38 .cse60 .cse49)) (.cse13 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse14 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse15 (not (<= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse25 (and .cse53 .cse54 .cse55 .cse47 .cse41 .cse56 .cse32 .cse43 .cse57 .cse58 .cse59 .cse34 .cse35 .cse52 .cse36 .cse48 .cse37 .cse38 .cse60 .cse49 .cse45)) (.cse16 (not (<= 2 |old(~b0_ev~0)|))) (.cse17 (not .cse52))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse19 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse21 .cse2 .cse22 .cse3 .cse4 .cse23 .cse6 .cse7 .cse8 .cse18 .cse19 .cse10 .cse11 .cse20 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse28 .cse18 .cse29 .cse19 .cse10 .cse30 .cse11 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse21 .cse2 .cse22 .cse26 .cse3 .cse4 .cse23 .cse6 .cse31 .cse27 (and (= ~d1_ev~0 |old(~d1_ev~0)|) .cse32 .cse33 .cse34 .cse35 (= |old(~d0_ev~0)| ~d0_ev~0) .cse36 (= |old(~z_ev~0)| ~z_ev~0) .cse37 .cse38 (= |old(~b1_ev~0)| ~b1_ev~0)) .cse7 .cse8 .cse28 .cse18 .cse29 .cse19 .cse39 .cse10 .cse30 .cse11 .cse20 .cse24 .cse13 .cse14 .cse15 .cse25 .cse40 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse29 .cse9 .cse10 .cse30 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17) (or (not (= ~comp_m1_st~0 0)) .cse0 (and .cse41 .cse32 .cse42 .cse43 .cse44 .cse34 .cse35 .cse36 .cse37 .cse38 .cse45 .cse46) .cse2 .cse3 .cse4 (and .cse47 .cse41 .cse32 .cse42 .cse43 .cse34 .cse35 .cse36 .cse37 .cse38 .cse45) .cse23 .cse6 (not (= |old(~d0_req_up~0)| 1)) .cse7 (and .cse41 .cse32 .cse43 .cse44 .cse34 .cse35 .cse36 .cse48 .cse37 .cse38 .cse49 .cse45 .cse46) (and .cse47 .cse32 .cse43 .cse50 .cse34 .cse35 .cse51 .cse36 .cse48 .cse37 .cse38 .cse49 .cse45) .cse19 (and .cse47 .cse41 .cse32 .cse43 .cse34 .cse35 .cse36 .cse48 .cse37 .cse38 .cse49 .cse45) .cse30 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (not (= |old(~b1_req_up~0)| 1)) (and .cse32 .cse42 .cse43 .cse44 .cse50 .cse34 .cse35 .cse51 .cse36 .cse37 .cse38 .cse45 .cse46) .cse40 .cse16 .cse17 (and .cse47 .cse32 .cse42 .cse43 .cse50 .cse34 .cse35 .cse51 .cse36 .cse37 .cse38 .cse45)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse6 .cse31 .cse27 .cse7 .cse8 .cse29 .cse9 .cse39 .cse10 .cse30 .cse11 .cse24 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17)))) [2022-11-20 12:15:49,348 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 211 249) no Hoare annotation was computed. [2022-11-20 12:15:49,349 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 187) no Hoare annotation was computed. [2022-11-20 12:15:49,349 INFO L899 garLoopResultBuilder]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2022-11-20 12:15:49,350 INFO L895 garLoopResultBuilder]: At program point L145(lines 133 147) the Hoare annotation is: (let ((.cse21 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse22 (<= |old(~b1_ev~0)| ~b1_ev~0)) (.cse23 (<= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse26 (<= |old(~d0_ev~0)| ~d0_ev~0)) (.cse28 (<= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse30 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse31 (= ~b0_ev~0 0)) (.cse33 (<= ~b1_ev~0 |old(~b1_ev~0)|)) (.cse34 (<= ~d0_val_t~0 ~d0_val~0)) (.cse35 (<= ~b1_val_t~0 ~b1_val~0)) (.cse24 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse25 (<= ~b0_val_t~0 ~b0_val~0)) (.cse27 (= ~z_val~0 0)) (.cse36 (<= ~d1_val_t~0 ~d1_val~0)) (.cse37 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse29 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse32 (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (let ((.cse18 (not (<= |old(~d1_ev~0)| 0))) (.cse7 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse8 (and (= ~d1_ev~0 |old(~d1_ev~0)|) .cse34 (= ~b0_ev~0 |old(~b0_ev~0)|) .cse35 .cse24 .cse25 (= |old(~d0_ev~0)| ~d0_ev~0) .cse27 (= |old(~z_ev~0)| ~z_ev~0) .cse36 .cse37 .cse29 (= |old(~b1_ev~0)| ~b1_ev~0) .cse32)) (.cse20 (not (<= |old(~b1_ev~0)| 0))) (.cse10 (not (<= 1 ~b0_val_t~0))) (.cse11 (not (<= |old(~d0_ev~0)| 0))) (.cse12 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse13 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse14 (not (<= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse15 (and .cse34 .cse21 .cse22 .cse23 .cse35 .cse24 .cse25 .cse26 .cse27 .cse28 .cse36 .cse37 .cse29 .cse30 .cse31 .cse32 .cse33)) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse1 (not (<= ~comp_m1_i~0 0))) (.cse2 (not (<= 1 ~d1_val_t~0))) (.cse3 (not (<= 1 ~d0_val_t~0))) (.cse4 (not (<= 2 |old(~d1_ev~0)|))) (.cse5 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse6 (not (= |old(~z_val~0)| 0))) (.cse9 (not (<= 2 |old(~b1_ev~0)|))) (.cse19 (not (<= 2 |old(~d0_ev~0)|))) (.cse16 (not (<= 2 |old(~b0_ev~0)|))) (.cse17 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse20 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or (not (= ~comp_m1_st~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~d0_req_up~0)| 1)) .cse6 .cse9 .cse19 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (not (= |old(~b1_req_up~0)| 1)) (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (= 1 ~b1_req_up~0) .cse32 .cse33) .cse16 .cse17)))) [2022-11-20 12:15:49,350 INFO L899 garLoopResultBuilder]: For program point L240-1(lines 208 250) no Hoare annotation was computed. [2022-11-20 12:15:49,350 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 142) no Hoare annotation was computed. [2022-11-20 12:15:49,350 INFO L899 garLoopResultBuilder]: For program point L137-2(lines 137 142) no Hoare annotation was computed. [2022-11-20 12:15:49,350 INFO L899 garLoopResultBuilder]: For program point L212-1(lines 211 249) no Hoare annotation was computed. [2022-11-20 12:15:49,351 INFO L895 garLoopResultBuilder]: At program point L175(lines 163 177) the Hoare annotation is: (let ((.cse58 (<= 1 ~b1_val_t~0)) (.cse57 (<= 2 ~d1_ev~0)) (.cse60 (<= 2 ~b1_ev~0)) (.cse24 (<= |old(~b1_ev~0)| ~b1_ev~0)) (.cse33 (<= ~b1_ev~0 |old(~b1_ev~0)|)) (.cse21 (<= ~d0_ev~0 0)) (.cse51 (= ~z_val~0 ~z_val_t~0)) (.cse53 (= |old(~z_val~0)| ~z_val~0)) (.cse61 (<= ~d1_ev~0 0)) (.cse54 (<= 1 ~d0_val_t~0)) (.cse55 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse56 (<= 1 ~b0_val_t~0)) (.cse59 (<= 1 ~d1_val_t~0)) (.cse50 (<= ~comp_m1_i~0 0)) (.cse52 (<= 2 ~z_ev~0)) (.cse34 (<= ~b1_ev~0 0)) (.cse22 (<= ~d0_val_t~0 ~d0_val~0)) (.cse23 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse35 (<= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse25 (<= ~b1_val_t~0 ~b1_val~0)) (.cse62 (<= 2 ~d0_ev~0)) (.cse26 (<= ~b0_val_t~0 ~b0_val~0)) (.cse36 (<= |old(~d0_ev~0)| ~d0_ev~0)) (.cse27 (= ~z_val~0 0)) (.cse28 (<= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse49 (<= ~d1_val_t~0 ~d1_val~0)) (.cse29 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse30 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse31 (= ~b0_ev~0 0)) (.cse32 (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (let ((.cse41 (and .cse50 .cse52 .cse34 .cse22 .cse23 .cse35 .cse25 .cse62 .cse26 .cse36 .cse27 .cse28 .cse49 .cse29 .cse30 .cse31 .cse32)) (.cse8 (not (<= |old(~b1_ev~0)| 0))) (.cse45 (and .cse50 .cse51 .cse52 .cse34 .cse53 .cse22 .cse61 .cse23 .cse54 .cse55 .cse56 .cse35 .cse25 .cse62 .cse26 .cse36 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse32)) (.cse18 (and .cse50 .cse51 .cse52 .cse34 .cse21 .cse53 .cse22 .cse61 .cse23 .cse54 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse31 .cse32)) (.cse19 (and .cse50 .cse51 .cse52 .cse34 .cse21 .cse53 .cse22 .cse61 .cse23 .cse54 .cse55 .cse56 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse32)) (.cse20 (not (<= |old(~d1_ev~0)| 0))) (.cse43 (and .cse50 .cse51 .cse52 .cse60 .cse21 .cse53 .cse22 .cse61 .cse23 .cse54 .cse56 .cse24 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse31 .cse32 .cse33)) (.cse10 (not (<= |old(~d0_ev~0)| 0))) (.cse44 (and .cse50 .cse51 .cse52 .cse60 .cse21 .cse53 .cse22 .cse61 .cse23 .cse54 .cse55 .cse24 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse32 .cse33)) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse39 (and .cse50 .cse52 .cse34 .cse22 .cse23 .cse57 .cse35 .cse25 .cse26 .cse36 .cse27 .cse28 .cse49 .cse29 .cse30 .cse31 .cse32)) (.cse1 (not .cse50)) (.cse2 (not .cse59)) (.cse3 (not .cse54)) (.cse4 (not (<= 2 |old(~d1_ev~0)|))) (.cse5 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse6 (not (= |old(~z_val~0)| 0))) (.cse7 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse37 (not (<= 2 |old(~b1_ev~0)|))) (.cse47 (and .cse50 .cse51 .cse52 .cse60 .cse21 .cse53 .cse22 .cse23 .cse54 .cse24 .cse57 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse31 .cse32 .cse33)) (.cse40 (and .cse50 .cse51 .cse52 .cse34 .cse53 .cse22 .cse23 .cse54 .cse55 .cse57 .cse35 .cse25 .cse26 .cse36 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse32)) (.cse38 (not (<= 2 |old(~d0_ev~0)|))) (.cse48 (and .cse50 .cse51 .cse52 .cse60 .cse21 .cse53 .cse22 .cse23 .cse54 .cse55 .cse24 .cse57 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse32 .cse33)) (.cse9 (not .cse56)) (.cse42 (and (= ~d1_ev~0 |old(~d1_ev~0)|) .cse22 .cse55 .cse25 .cse26 (= |old(~d0_ev~0)| ~d0_ev~0) .cse27 (= |old(~z_ev~0)| ~z_ev~0) .cse49 .cse29 (= |old(~b1_ev~0)| ~b1_ev~0) .cse32)) (.cse11 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse12 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse13 (not (<= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse14 (not (<= 2 |old(~b0_ev~0)|))) (.cse15 (and .cse50 .cse51 .cse52 .cse34 .cse21 .cse53 .cse22 .cse23 .cse54 .cse57 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse31 .cse32)) (.cse16 (not .cse58)) (.cse17 (and .cse50 .cse51 .cse52 .cse34 .cse21 .cse53 .cse22 .cse23 .cse54 .cse55 .cse56 .cse57 .cse25 .cse26 .cse58 .cse27 .cse28 .cse49 (<= 2 ~b0_ev~0) .cse29 .cse59 .cse30 .cse32)) (.cse46 (and .cse22 .cse23 .cse24 .cse35 .cse25 .cse26 .cse36 .cse27 .cse28 .cse49 .cse29 .cse30 .cse31 .cse32 .cse33))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or (not (= ~comp_m1_st~0 0)) (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) .cse0 .cse1 (and .cse34 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse2 (and .cse34 .cse22 .cse23 .cse35 .cse25 .cse26 .cse36 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse3 .cse4 .cse5 (not (= |old(~d0_req_up~0)| 1)) .cse6 (and .cse22 .cse23 .cse24 .cse35 .cse25 .cse26 .cse36 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) .cse37 .cse38 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (not (= |old(~b1_req_up~0)| 1)) .cse14 .cse16) (or .cse0 .cse39 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse40 .cse38 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse41 .cse37 .cse38 .cse9 .cse42 .cse43 .cse11 .cse12 .cse44 .cse45 .cse13 .cse14 .cse16 .cse46) (or .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse41 .cse8 .cse38 .cse9 .cse11 .cse12 .cse45 .cse13 .cse14 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse37 .cse47 .cse48 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse37 .cse9 .cse43 .cse10 .cse11 .cse12 .cse44 .cse13 .cse14 .cse16) (or .cse0 .cse39 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse37 .cse47 .cse40 .cse38 .cse48 .cse9 .cse42 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse46)))) [2022-11-20 12:15:49,352 INFO L899 garLoopResultBuilder]: For program point L233-1(lines 211 249) no Hoare annotation was computed. [2022-11-20 12:15:49,352 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2022-11-20 12:15:49,352 INFO L899 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2022-11-20 12:15:49,352 INFO L899 garLoopResultBuilder]: For program point L374-1(lines 350 382) no Hoare annotation was computed. [2022-11-20 12:15:49,353 INFO L895 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 350 382) the Hoare annotation is: (let ((.cse17 (not (= ~comp_m1_st~0 0))) (.cse4 (not (<= |old(~d1_ev~0)| 0))) (.cse13 (not (<= |old(~d0_ev~0)| 0))) (.cse18 (not (<= |old(~b1_ev~0)| 0))) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse1 (not (<= ~comp_m1_i~0 0))) (.cse2 (not (<= 1 ~d1_val_t~0))) (.cse3 (not (<= 1 ~d0_val_t~0))) (.cse20 (not (<= 2 |old(~d1_ev~0)|))) (.cse5 (not (= ~z_val~0 ~z_val_t~0))) (.cse6 (and (= ~d1_ev~0 |old(~d1_ev~0)|) (= ~b0_ev~0 |old(~b0_ev~0)|) (= |old(~d0_ev~0)| ~d0_ev~0) (= |old(~z_ev~0)| ~z_ev~0) (= |old(~b1_ev~0)| ~b1_ev~0))) (.cse7 (not (= ~z_val~0 0))) (.cse8 (not (<= 2 |old(~b1_ev~0)|))) (.cse19 (not (<= 2 |old(~d0_ev~0)|))) (.cse9 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse10 (not (<= ~d0_val_t~0 ~d0_val~0))) (.cse11 (not (<= 1 ~b0_val_t~0))) (.cse12 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse14 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse15 (not (<= 2 |old(~b0_ev~0)|))) (.cse16 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 (not (= |old(~b0_ev~0)| 1)) .cse12 .cse14 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse18 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16))) [2022-11-20 12:15:49,355 INFO L899 garLoopResultBuilder]: For program point L364-1(lines 353 381) no Hoare annotation was computed. [2022-11-20 12:15:49,357 INFO L899 garLoopResultBuilder]: For program point L354-1(lines 353 381) no Hoare annotation was computed. [2022-11-20 12:15:49,358 INFO L899 garLoopResultBuilder]: For program point L369-1(lines 353 381) no Hoare annotation was computed. [2022-11-20 12:15:49,358 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 350 382) no Hoare annotation was computed. [2022-11-20 12:15:49,358 INFO L899 garLoopResultBuilder]: For program point L359-1(lines 353 381) no Hoare annotation was computed. [2022-11-20 12:15:49,359 INFO L895 garLoopResultBuilder]: At program point L415(lines 399 417) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-11-20 12:15:49,361 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-11-20 12:15:49,362 INFO L899 garLoopResultBuilder]: For program point L440-1(line 440) no Hoare annotation was computed. [2022-11-20 12:15:49,362 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2022-11-20 12:15:49,362 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2022-11-20 12:15:49,362 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 51 101) no Hoare annotation was computed. [2022-11-20 12:15:49,362 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-11-20 12:15:49,363 INFO L895 garLoopResultBuilder]: At program point L432-1(lines 429 454) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-11-20 12:15:49,363 INFO L895 garLoopResultBuilder]: At program point L490(lines 461 492) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (= ~z_val~0 ~z_val_t~0) (<= 2 ~z_ev~0) (= ~b0_req_up~0 1) (= ~comp_m1_st~0 0) (<= 2 ~b1_ev~0) (<= 1 ~d0_val_t~0) (= ~b0_val_t~0 1) (<= 2 ~d1_ev~0) (= ~d0_req_up~0 1) (= ~b0_val~0 0) (<= 2 ~d0_ev~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= 2 ~b0_ev~0) (= ~d1_req_up~0 1) (<= 1 ~d1_val_t~0) (= 1 ~b1_req_up~0)) [2022-11-20 12:15:49,364 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2022-11-20 12:15:49,364 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 12:15:49,364 INFO L899 garLoopResultBuilder]: For program point L61(lines 51 101) no Hoare annotation was computed. [2022-11-20 12:15:49,364 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 12:15:49,364 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2022-11-20 12:15:49,365 INFO L895 garLoopResultBuilder]: At program point L20(lines 15 22) the Hoare annotation is: false [2022-11-20 12:15:49,365 INFO L899 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2022-11-20 12:15:49,365 INFO L895 garLoopResultBuilder]: At program point L425(line 425) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (= ~z_val~0 ~z_val_t~0) (<= 2 ~z_ev~0) (= ~b0_req_up~0 1) (= ~comp_m1_st~0 0) (<= 2 ~b1_ev~0) (<= 1 ~d0_val_t~0) (= ~b0_val_t~0 1) (<= 2 ~d1_ev~0) (= ~d0_req_up~0 1) (= ~b0_val~0 0) (<= 2 ~d0_ev~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= 2 ~b0_ev~0) (= ~d1_req_up~0 1) (<= 1 ~d1_val_t~0) (= 1 ~b1_req_up~0)) [2022-11-20 12:15:49,365 INFO L899 garLoopResultBuilder]: For program point L425-1(line 425) no Hoare annotation was computed. [2022-11-20 12:15:49,365 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2022-11-20 12:15:49,366 INFO L899 garLoopResultBuilder]: For program point L79(lines 51 101) no Hoare annotation was computed. [2022-11-20 12:15:49,367 INFO L895 garLoopResultBuilder]: At program point L286(line 286) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-11-20 12:15:49,367 INFO L902 garLoopResultBuilder]: At program point L509(lines 493 511) the Hoare annotation is: true [2022-11-20 12:15:49,367 INFO L895 garLoopResultBuilder]: At program point L311(lines 279 316) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-11-20 12:15:49,367 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 507) no Hoare annotation was computed. [2022-11-20 12:15:49,368 INFO L899 garLoopResultBuilder]: For program point L501-2(lines 501 507) no Hoare annotation was computed. [2022-11-20 12:15:49,368 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 84) no Hoare annotation was computed. [2022-11-20 12:15:49,368 INFO L895 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse16 (<= 2 ~d1_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse18 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse17 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-11-20 12:15:49,368 INFO L895 garLoopResultBuilder]: At program point L427-1(line 427) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (= ~z_val~0 ~z_val_t~0) (<= 2 ~z_ev~0) (= ~b0_ev~0 1) (<= ~d0_val_t~0 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= 1 ~b0_val_t~0) (<= ~b1_val_t~0 ~b1_val~0) (<= ~b0_val_t~0 ~b0_val~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= ~d1_val_t~0 ~d1_val~0) (<= 1 ~d1_val_t~0)) [2022-11-20 12:15:49,369 INFO L895 garLoopResultBuilder]: At program point L295(lines 285 310) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-11-20 12:15:49,369 INFO L895 garLoopResultBuilder]: At program point L444(line 444) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse18 (<= ~d0_ev~0 0)) (.cse16 (<= 2 ~d1_ev~0)) (.cse17 (<= 2 ~b0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse19 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse19 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse19 .cse18 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse19 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse19 .cse18 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-11-20 12:15:49,370 INFO L895 garLoopResultBuilder]: At program point L444-1(line 444) the Hoare annotation is: (let ((.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse3 (<= ~d0_val_t~0 ~d0_val~0)) (.cse4 (<= 1 ~d0_val_t~0)) (.cse5 (<= 1 ~b0_val_t~0)) (.cse6 (<= ~b1_val_t~0 ~b1_val~0)) (.cse7 (<= ~b0_val_t~0 ~b0_val~0)) (.cse8 (<= 1 ~b1_val_t~0)) (.cse9 (= ~z_val~0 0)) (.cse10 (<= ~d1_val_t~0 ~d1_val~0)) (.cse11 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 (= ~b0_ev~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 2 ~b0_ev~0) .cse11))) [2022-11-20 12:15:49,370 INFO L895 garLoopResultBuilder]: At program point L428(line 428) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (= ~z_val~0 ~z_val_t~0) (<= 2 ~z_ev~0) (= ~comp_m1_st~0 0) (= ~b0_ev~0 1) (<= ~d0_val_t~0 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= 1 ~b0_val_t~0) (<= ~b1_val_t~0 ~b1_val~0) (<= ~b0_val_t~0 ~b0_val~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= ~d1_val_t~0 ~d1_val~0) (<= 1 ~d1_val_t~0)) [2022-11-20 12:15:49,370 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2022-11-20 12:15:49,370 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 51 101) no Hoare annotation was computed. [2022-11-20 12:15:49,370 INFO L899 garLoopResultBuilder]: For program point L288(line 288) no Hoare annotation was computed. [2022-11-20 12:15:49,371 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 12:15:49,371 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2022-11-20 12:15:49,371 INFO L895 garLoopResultBuilder]: At program point L255-2(lines 251 263) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse16 (<= 2 ~d1_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse18 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse17 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-11-20 12:15:49,372 INFO L895 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: (let ((.cse3 (= ~comp_m1_st~0 0)) (.cse14 (<= 2 ~b1_ev~0)) (.cse16 (<= 2 ~d0_ev~0)) (.cse15 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse17 (<= ~b1_ev~0 0)) (.cse19 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse18 (<= 2 ~d1_ev~0)) (.cse7 (<= ~b1_val_t~0 ~b1_val~0)) (.cse8 (<= ~b0_val_t~0 ~b0_val~0)) (.cse9 (<= 1 ~b1_val_t~0)) (.cse10 (= ~z_val~0 0)) (.cse11 (<= ~d1_val_t~0 ~d1_val~0)) (.cse13 (<= 2 ~b0_ev~0)) (.cse12 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~b0_ev~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse18 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse14 .cse19 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse14 .cse19 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse18 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse17 .cse19 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse17 .cse19 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12))) [2022-11-20 12:15:49,372 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-11-20 12:15:49,372 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 12:15:49,372 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2022-11-20 12:15:49,373 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2022-11-20 12:15:49,374 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 88 96) no Hoare annotation was computed. [2022-11-20 12:15:49,374 INFO L895 garLoopResultBuilder]: At program point L405(line 405) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-11-20 12:15:49,374 INFO L899 garLoopResultBuilder]: For program point L405-1(line 405) no Hoare annotation was computed. [2022-11-20 12:15:49,374 INFO L895 garLoopResultBuilder]: At program point L455(lines 418 460) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (= ~z_val~0 ~z_val_t~0) (<= ~d0_val_t~0 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= 1 ~b0_val_t~0) (<= ~b1_val_t~0 ~b1_val~0) (<= ~b0_val_t~0 ~b0_val~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= 2 ~b0_ev~0)) [2022-11-20 12:15:49,375 INFO L895 garLoopResultBuilder]: At program point L100(lines 46 102) the Hoare annotation is: (let ((.cse6 (<= ~d1_ev~0 0)) (.cse3 (<= ~b1_ev~0 0)) (.cse18 (<= 2 ~d0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse17 (<= 2 ~b1_ev~0)) (.cse4 (<= ~d0_ev~0 0)) (.cse5 (<= ~d0_val_t~0 ~d0_val~0)) (.cse7 (<= 1 ~d0_val_t~0)) (.cse8 (<= 1 ~b0_val_t~0)) (.cse19 (<= 2 ~d1_ev~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (= ~z_req_up~0 1)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse15 (<= 2 ~b0_ev~0)) (.cse16 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse5 .cse7 .cse8 .cse19 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse19 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-11-20 12:15:49,375 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2022-11-20 12:15:49,375 INFO L899 garLoopResultBuilder]: For program point L290-1(lines 285 310) no Hoare annotation was computed. [2022-11-20 12:15:49,376 INFO L895 garLoopResultBuilder]: At program point L414(lines 403 416) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-11-20 12:15:49,376 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 306) no Hoare annotation was computed. [2022-11-20 12:15:49,380 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:15:49,382 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:15:49,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:15:49 BoogieIcfgContainer [2022-11-20 12:15:49,599 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:15:49,600 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:15:49,600 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:15:49,600 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:15:49,601 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:12:30" (3/4) ... [2022-11-20 12:15:49,604 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 12:15:49,612 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-11-20 12:15:49,613 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-11-20 12:15:49,613 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-11-20 12:15:49,613 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-11-20 12:15:49,613 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-11-20 12:15:49,622 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-11-20 12:15:49,622 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-20 12:15:49,623 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 12:15:49,624 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 12:15:49,656 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && ((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_req_up) == 1)) || (((((((((((((\old(z_ev) <= z_ev && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && 1 == b1_req_up) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) [2022-11-20 12:15:49,656 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) && (((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || ((((((((((((b1_ev <= 0 && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(\old(b1_req_up) == 1)) || !(2 <= \old(b0_ev))) || (((((((((((((\old(z_ev) <= z_ev && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || ((((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || ((((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) [2022-11-20 12:15:49,658 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) && ((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((!(comp_m1_st == 0) || ((((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || (((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d1_val_t)) || ((((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || (((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_req_up) == 1)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)))) && ((((((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || ((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev)))) && ((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(2 <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)))) && ((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(2 <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(d0_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || (((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || ((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) [2022-11-20 12:15:49,659 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(b1_ev))) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(b1_ev))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || (((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(\old(b1_ev) <= 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || (((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || ((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || ((((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || (((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_req_up) == 1)) || ((((((((((((d0_val_t <= d0_val && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || (((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0))) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(\old(b1_ev) <= 0)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) [2022-11-20 12:15:49,660 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(1 <= b1_val_t)) && (((((((((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || (((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && d1_ev == \old(d1_ev)) && 2 <= b1_ev) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && \old(b1_ev) == b1_ev)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || (((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(1 <= b0_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || (((((((((((d0_val_t <= d0_val && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || ((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || ((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || (((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0)) || !(\old(b1_req_up) == 1)) || !(2 <= \old(b0_ev))) || (((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t)) [2022-11-20 12:15:49,662 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(b1_ev == 1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) || 1 <= __retres1) && ((((((((((((((!(comp_m1_i <= 0) || !(d1_ev == 1)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) || 1 <= __retres1)) && (((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(z_val == z_val_t)) || !(b0_ev == 1)) || !(2 <= z_ev)) || !(z_val == 0)) || (comp_m1_st == \old(comp_m1_st) && 1 <= __retres1)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((comp_m1_st == \old(comp_m1_st) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && ((((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(d0_ev == 1)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) || 1 <= __retres1) [2022-11-20 12:15:49,663 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(z_val == z_val_t)) || !(b0_ev == 1)) || !(2 <= z_ev)) || ((comp_m1_st == \old(comp_m1_st) && 1 <= \result) && 1 <= __retres1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) && (((((((((((((((1 <= \result && 1 <= __retres1) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(d0_ev == 1)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((comp_m1_st == \old(comp_m1_st) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && ((((((((((((((!(comp_m1_i <= 0) || !(d1_ev == 1)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || ((comp_m1_st == \old(comp_m1_st) && 1 <= \result) && 1 <= __retres1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((((1 <= \result && 1 <= __retres1) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(b1_ev == 1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) [2022-11-20 12:15:49,726 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:15:49,726 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:15:49,727 INFO L158 Benchmark]: Toolchain (without parser) took 200388.18ms. Allocated memory was 165.7MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 133.3MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2022-11-20 12:15:49,728 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 127.9MB. Free memory was 72.8MB in the beginning and 72.7MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:15:49,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.36ms. Allocated memory is still 165.7MB. Free memory was 132.5MB in the beginning and 120.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 12:15:49,734 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.61ms. Allocated memory is still 165.7MB. Free memory was 120.0MB in the beginning and 117.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:15:49,737 INFO L158 Benchmark]: Boogie Preprocessor took 40.24ms. Allocated memory is still 165.7MB. Free memory was 117.9MB in the beginning and 115.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:15:49,738 INFO L158 Benchmark]: RCFGBuilder took 825.40ms. Allocated memory is still 165.7MB. Free memory was 115.8MB in the beginning and 97.7MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 12:15:49,738 INFO L158 Benchmark]: TraceAbstraction took 198912.17ms. Allocated memory was 165.7MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 96.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2022-11-20 12:15:49,739 INFO L158 Benchmark]: Witness Printer took 126.55ms. Allocated memory is still 3.0GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 12:15:49,740 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 127.9MB. Free memory was 72.8MB in the beginning and 72.7MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.36ms. Allocated memory is still 165.7MB. Free memory was 132.5MB in the beginning and 120.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.61ms. Allocated memory is still 165.7MB. Free memory was 120.0MB in the beginning and 117.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.24ms. Allocated memory is still 165.7MB. Free memory was 117.9MB in the beginning and 115.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 825.40ms. Allocated memory is still 165.7MB. Free memory was 115.8MB in the beginning and 97.7MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 198912.17ms. Allocated memory was 165.7MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 96.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 126.55ms. Allocated memory is still 3.0GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 198.6s, OverallIterations: 34, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.7s, AutomataDifference: 33.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 116.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6255 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6180 mSDsluCounter, 13785 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8707 mSDsCounter, 711 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5144 IncrementalHoareTripleChecker+Invalid, 5855 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 711 mSolverCounterUnsat, 5078 mSDtfsCounter, 5144 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4597 GetRequests, 4226 SyntacticMatches, 6 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11183occurred in iteration=33, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.8s AutomataMinimizationTime, 34 MinimizatonAttempts, 14460 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 22312 PreInvPairs, 23589 NumberOfFragments, 24499 HoareAnnotationTreeSize, 22312 FomulaSimplifications, 111471 FormulaSimplificationTreeSizeReduction, 18.7s HoareSimplificationTime, 34 FomulaSimplificationsInter, 864480 FormulaSimplificationTreeSizeReductionInter, 97.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 7376 NumberOfCodeBlocks, 7320 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 7448 ConstructedInterpolants, 0 QuantifiedInterpolants, 16593 SizeOfPredicates, 12 NumberOfNonLiveVariables, 15898 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 66 InterpolantComputations, 33 PerfectInterpolantSequences, 2243/2459 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b0_req_up == 1) && comp_m1_st == 0) && 2 <= b1_ev) && 1 <= d0_val_t) && b0_val_t == 1) && 2 <= d1_ev) && d0_req_up == 1) && b0_val == 0) && 2 <= d0_ev) && 1 <= b1_val_t) && z_val == 0) && 2 <= b0_ev) && d1_req_up == 1) && 1 <= d1_val_t) && 1 == b1_req_up - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(1 <= b1_val_t)) && (((((((((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || (((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && d1_ev == \old(d1_ev)) && 2 <= b1_ev) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && \old(b1_ev) == b1_ev)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || (((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(1 <= b0_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || (((((((((((d0_val_t <= d0_val && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || ((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || ((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || (((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0)) || !(\old(b1_req_up) == 1)) || !(2 <= \old(b0_ev))) || (((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t)) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(b1_ev))) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(b1_ev))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || (((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(\old(b1_ev) <= 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || (((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || ((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || ((((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || (((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_req_up) == 1)) || ((((((((((((d0_val_t <= d0_val && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || (((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0))) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(\old(b1_ev) <= 0)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((((((comp_m1_i <= 0 && z_val == z_val_t) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && 2 <= b0_ev - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (((((((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(b1_ev == 1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) || 1 <= __retres1) && ((((((((((((((!(comp_m1_i <= 0) || !(d1_ev == 1)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) || 1 <= __retres1)) && (((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(z_val == z_val_t)) || !(b0_ev == 1)) || !(2 <= z_ev)) || !(z_val == 0)) || (comp_m1_st == \old(comp_m1_st) && 1 <= __retres1)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((comp_m1_st == \old(comp_m1_st) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && ((((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(d0_ev == 1)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) || 1 <= __retres1) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(d1_ev <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(b1_ev <= 0)) || !(2 <= d0_ev)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(2 <= d1_ev)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(2 <= b1_ev)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(b0_val_t <= b0_val)) || !(d0_ev <= 0)) || !(1 <= b1_val_t))) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(2 <= d1_ev)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(2 <= b1_ev)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(2 <= d0_ev)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(d1_ev <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(2 <= b1_ev)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(2 <= d0_ev)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(d1_ev <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(b1_ev <= 0)) || !(b0_val_t <= b0_val)) || !(d0_ev <= 0)) || !(1 <= b1_val_t))) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(2 <= d1_ev)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(b1_ev <= 0)) || !(b0_val_t <= b0_val)) || !(d0_ev <= 0)) || !(1 <= b1_val_t))) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(d1_ev <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(2 <= b1_ev)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(b0_val_t <= b0_val)) || !(d0_ev <= 0)) || !(1 <= b1_val_t))) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(2 <= d1_ev)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(b1_ev <= 0)) || !(2 <= d0_ev)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) - InvariantResult [Line: 429]: Loop Invariant Derived loop invariant: (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(z_val == z_val_t)) || !(b0_ev == 1)) || !(2 <= z_ev)) || ((comp_m1_st == \old(comp_m1_st) && 1 <= \result) && 1 <= __retres1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) && (((((((((((((((1 <= \result && 1 <= __retres1) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(d0_ev == 1)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((comp_m1_st == \old(comp_m1_st) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && ((((((((((((((!(comp_m1_i <= 0) || !(d1_ev == 1)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || ((comp_m1_st == \old(comp_m1_st) && 1 <= \result) && 1 <= __retres1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((((1 <= \result && 1 <= __retres1) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(b1_ev == 1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) && ((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((!(comp_m1_st == 0) || ((((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || (((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d1_val_t)) || ((((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || (((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_req_up) == 1)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)))) && ((((((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || ((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev)))) && ((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(2 <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)))) && ((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(2 <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(d0_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || (((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || ((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) && (((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || ((((((((((((b1_ev <= 0 && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(\old(b1_req_up) == 1)) || !(2 <= \old(b0_ev))) || (((((((((((((\old(z_ev) <= z_ev && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || ((((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || ((((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && ((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_req_up) == 1)) || (((((((((((((\old(z_ev) <= z_ev && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && 1 == b1_req_up) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) RESULT: Ultimate proved your program to be correct! [2022-11-20 12:15:49,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfbe7102-ba49-4982-ba3d-d246ed7676a4/bin/uautomizer-ug76WZFUDN/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