./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 21:07:43,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 21:07:43,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 21:07:43,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 21:07:43,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 21:07:43,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 21:07:43,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 21:07:43,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 21:07:43,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 21:07:43,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 21:07:43,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 21:07:43,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 21:07:43,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 21:07:43,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 21:07:43,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 21:07:43,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 21:07:43,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 21:07:43,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 21:07:43,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 21:07:43,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 21:07:43,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 21:07:43,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 21:07:43,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 21:07:43,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 21:07:43,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 21:07:43,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 21:07:43,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 21:07:43,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 21:07:43,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 21:07:43,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 21:07:43,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 21:07:43,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 21:07:43,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 21:07:43,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 21:07:43,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 21:07:43,844 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 21:07:43,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 21:07:43,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 21:07:43,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 21:07:43,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 21:07:43,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 21:07:43,851 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 21:07:43,884 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 21:07:43,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 21:07:43,886 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 21:07:43,887 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 21:07:43,887 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 21:07:43,888 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 21:07:43,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 21:07:43,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 21:07:43,889 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 21:07:43,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 21:07:43,890 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 21:07:43,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 21:07:43,890 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 21:07:43,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 21:07:43,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 21:07:43,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 21:07:43,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 21:07:43,891 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 21:07:43,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 21:07:43,891 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 21:07:43,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 21:07:43,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 21:07:43,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 21:07:43,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 21:07:43,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 21:07:43,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 21:07:43,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 21:07:43,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 21:07:43,894 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 21:07:43,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 21:07:43,895 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 21:07:43,895 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 21:07:43,895 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 21:07:43,895 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 21:07:43,895 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 [2021-12-17 21:07:44,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 21:07:44,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 21:07:44,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 21:07:44,161 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 21:07:44,162 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 21:07:44,163 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2021-12-17 21:07:44,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ee8c4d1a/c077eb0072ba4c2bb2b44b8647dbb669/FLAG10425607a [2021-12-17 21:07:44,662 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 21:07:44,662 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2021-12-17 21:07:44,673 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ee8c4d1a/c077eb0072ba4c2bb2b44b8647dbb669/FLAG10425607a [2021-12-17 21:07:45,077 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ee8c4d1a/c077eb0072ba4c2bb2b44b8647dbb669 [2021-12-17 21:07:45,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 21:07:45,082 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 21:07:45,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 21:07:45,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 21:07:45,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 21:07:45,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:07:45" (1/1) ... [2021-12-17 21:07:45,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48e4c983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:45, skipping insertion in model container [2021-12-17 21:07:45,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:07:45" (1/1) ... [2021-12-17 21:07:45,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 21:07:45,136 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 21:07:45,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2021-12-17 21:07:45,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2021-12-17 21:07:45,334 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 21:07:45,342 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 21:07:45,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2021-12-17 21:07:45,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2021-12-17 21:07:45,388 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 21:07:45,408 INFO L208 MainTranslator]: Completed translation [2021-12-17 21:07:45,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:45 WrapperNode [2021-12-17 21:07:45,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 21:07:45,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 21:07:45,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 21:07:45,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 21:07:45,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:45" (1/1) ... [2021-12-17 21:07:45,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:45" (1/1) ... [2021-12-17 21:07:45,455 INFO L137 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 498 [2021-12-17 21:07:45,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 21:07:45,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 21:07:45,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 21:07:45,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 21:07:45,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:45" (1/1) ... [2021-12-17 21:07:45,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:45" (1/1) ... [2021-12-17 21:07:45,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:45" (1/1) ... [2021-12-17 21:07:45,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:45" (1/1) ... [2021-12-17 21:07:45,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:45" (1/1) ... [2021-12-17 21:07:45,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:45" (1/1) ... [2021-12-17 21:07:45,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:45" (1/1) ... [2021-12-17 21:07:45,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 21:07:45,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 21:07:45,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 21:07:45,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 21:07:45,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:45" (1/1) ... [2021-12-17 21:07:45,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 21:07:45,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:07:45,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 21:07:45,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 21:07:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 21:07:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-17 21:07:45,586 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-17 21:07:45,586 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-17 21:07:45,587 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-17 21:07:45,587 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-17 21:07:45,587 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-17 21:07:45,587 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-17 21:07:45,587 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-17 21:07:45,588 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-17 21:07:45,588 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-17 21:07:45,588 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-17 21:07:45,588 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-17 21:07:45,588 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-17 21:07:45,588 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-17 21:07:45,588 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-17 21:07:45,588 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-17 21:07:45,588 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-17 21:07:45,588 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-17 21:07:45,588 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-17 21:07:45,588 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-17 21:07:45,588 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-17 21:07:45,588 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-17 21:07:45,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 21:07:45,589 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-17 21:07:45,589 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-17 21:07:45,589 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-17 21:07:45,589 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-17 21:07:45,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 21:07:45,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 21:07:45,589 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-17 21:07:45,589 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-17 21:07:45,707 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 21:07:45,709 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 21:07:46,057 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2021-12-17 21:07:46,057 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2021-12-17 21:07:46,102 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 21:07:46,110 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 21:07:46,110 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-17 21:07:46,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:07:46 BoogieIcfgContainer [2021-12-17 21:07:46,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 21:07:46,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 21:07:46,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 21:07:46,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 21:07:46,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 09:07:45" (1/3) ... [2021-12-17 21:07:46,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6beae433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:07:46, skipping insertion in model container [2021-12-17 21:07:46,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:45" (2/3) ... [2021-12-17 21:07:46,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6beae433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:07:46, skipping insertion in model container [2021-12-17 21:07:46,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:07:46" (3/3) ... [2021-12-17 21:07:46,121 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-1.c [2021-12-17 21:07:46,125 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 21:07:46,125 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-17 21:07:46,182 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 21:07:46,188 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 21:07:46,189 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-17 21:07:46,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 249 states, 200 states have (on average 1.555) internal successors, (311), 206 states have internal predecessors, (311), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-17 21:07:46,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:07:46,236 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:46,237 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:07:46,238 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:46,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:46,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1783891232, now seen corresponding path program 1 times [2021-12-17 21:07:46,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:46,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978107504] [2021-12-17 21:07:46,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:46,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:46,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:46,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:46,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:07:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:46,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:07:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:46,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:07:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:46,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:07:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:46,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:07:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:07:46,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:46,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978107504] [2021-12-17 21:07:46,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978107504] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:46,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:46,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:07:46,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571249920] [2021-12-17 21:07:46,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:46,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:07:46,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:46,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:07:46,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:07:46,719 INFO L87 Difference]: Start difference. First operand has 249 states, 200 states have (on average 1.555) internal successors, (311), 206 states have internal predecessors, (311), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 21:07:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:47,553 INFO L93 Difference]: Finished difference Result 631 states and 957 transitions. [2021-12-17 21:07:47,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 21:07:47,555 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-12-17 21:07:47,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:47,567 INFO L225 Difference]: With dead ends: 631 [2021-12-17 21:07:47,567 INFO L226 Difference]: Without dead ends: 390 [2021-12-17 21:07:47,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-17 21:07:47,574 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 515 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:47,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [522 Valid, 1382 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-17 21:07:47,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-12-17 21:07:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 351. [2021-12-17 21:07:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 282 states have (on average 1.446808510638298) internal successors, (408), 288 states have internal predecessors, (408), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2021-12-17 21:07:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 501 transitions. [2021-12-17 21:07:47,643 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 501 transitions. Word has length 65 [2021-12-17 21:07:47,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:47,644 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 501 transitions. [2021-12-17 21:07:47,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 21:07:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 501 transitions. [2021-12-17 21:07:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:07:47,648 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:47,648 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:07:47,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 21:07:47,648 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:47,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:47,649 INFO L85 PathProgramCache]: Analyzing trace with hash -832187424, now seen corresponding path program 1 times [2021-12-17 21:07:47,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:47,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329484013] [2021-12-17 21:07:47,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:47,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:47,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:47,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:47,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:07:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:47,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:07:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:47,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:07:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:47,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:07:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:47,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:07:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:07:47,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:47,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329484013] [2021-12-17 21:07:47,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329484013] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:47,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:47,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 21:07:47,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785633722] [2021-12-17 21:07:47,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:47,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 21:07:47,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:47,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 21:07:47,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-17 21:07:47,778 INFO L87 Difference]: Start difference. First operand 351 states and 501 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-17 21:07:49,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:49,427 INFO L93 Difference]: Finished difference Result 1384 states and 1961 transitions. [2021-12-17 21:07:49,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-17 21:07:49,428 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2021-12-17 21:07:49,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:49,436 INFO L225 Difference]: With dead ends: 1384 [2021-12-17 21:07:49,437 INFO L226 Difference]: Without dead ends: 1163 [2021-12-17 21:07:49,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-17 21:07:49,441 INFO L933 BasicCegarLoop]: 490 mSDtfsCounter, 2085 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2105 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:49,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2105 Valid, 1947 Invalid, 2168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-17 21:07:49,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2021-12-17 21:07:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1024. [2021-12-17 21:07:49,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 825 states have (on average 1.3903030303030304) internal successors, (1147), 839 states have internal predecessors, (1147), 116 states have call successors, (116), 74 states have call predecessors, (116), 81 states have return successors, (128), 112 states have call predecessors, (128), 114 states have call successors, (128) [2021-12-17 21:07:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1391 transitions. [2021-12-17 21:07:49,553 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1391 transitions. Word has length 65 [2021-12-17 21:07:49,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:49,553 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 1391 transitions. [2021-12-17 21:07:49,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-17 21:07:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1391 transitions. [2021-12-17 21:07:49,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-17 21:07:49,559 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:49,560 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:07:49,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 21:07:49,560 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:49,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:49,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1785966606, now seen corresponding path program 1 times [2021-12-17 21:07:49,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:49,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919473543] [2021-12-17 21:07:49,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:49,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:49,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:49,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:49,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:07:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:49,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:07:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:49,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:07:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:49,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 21:07:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:49,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-17 21:07:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:07:49,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:49,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919473543] [2021-12-17 21:07:49,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919473543] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:49,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:49,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 21:07:49,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207082220] [2021-12-17 21:07:49,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:49,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 21:07:49,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:49,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 21:07:49,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:07:49,737 INFO L87 Difference]: Start difference. First operand 1024 states and 1391 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 21:07:50,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:50,351 INFO L93 Difference]: Finished difference Result 2050 states and 2785 transitions. [2021-12-17 21:07:50,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 21:07:50,352 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2021-12-17 21:07:50,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:50,359 INFO L225 Difference]: With dead ends: 2050 [2021-12-17 21:07:50,360 INFO L226 Difference]: Without dead ends: 1162 [2021-12-17 21:07:50,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-17 21:07:50,370 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 266 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:50,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 1657 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 21:07:50,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2021-12-17 21:07:50,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1054. [2021-12-17 21:07:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 849 states have (on average 1.375736160188457) internal successors, (1168), 863 states have internal predecessors, (1168), 116 states have call successors, (116), 74 states have call predecessors, (116), 87 states have return successors, (134), 118 states have call predecessors, (134), 114 states have call successors, (134) [2021-12-17 21:07:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1418 transitions. [2021-12-17 21:07:50,435 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1418 transitions. Word has length 66 [2021-12-17 21:07:50,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:50,435 INFO L470 AbstractCegarLoop]: Abstraction has 1054 states and 1418 transitions. [2021-12-17 21:07:50,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 21:07:50,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1418 transitions. [2021-12-17 21:07:50,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-17 21:07:50,437 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:50,437 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:07:50,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 21:07:50,437 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:50,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:50,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1479641392, now seen corresponding path program 1 times [2021-12-17 21:07:50,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:50,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274179729] [2021-12-17 21:07:50,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:50,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:50,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:50,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:50,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:07:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:50,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:07:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:50,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:07:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:50,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 21:07:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:50,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-17 21:07:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:07:50,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:50,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274179729] [2021-12-17 21:07:50,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274179729] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:50,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:50,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 21:07:50,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072669348] [2021-12-17 21:07:50,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:50,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 21:07:50,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:50,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 21:07:50,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-17 21:07:50,555 INFO L87 Difference]: Start difference. First operand 1054 states and 1418 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-17 21:07:52,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:52,166 INFO L93 Difference]: Finished difference Result 3392 states and 4605 transitions. [2021-12-17 21:07:52,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-17 21:07:52,166 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2021-12-17 21:07:52,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:52,173 INFO L225 Difference]: With dead ends: 3392 [2021-12-17 21:07:52,173 INFO L226 Difference]: Without dead ends: 1297 [2021-12-17 21:07:52,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-17 21:07:52,184 INFO L933 BasicCegarLoop]: 474 mSDtfsCounter, 2436 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 676 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2456 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 2079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 676 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:52,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2456 Valid, 1727 Invalid, 2079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [676 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-17 21:07:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2021-12-17 21:07:52,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1142. [2021-12-17 21:07:52,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 902 states have (on average 1.335920177383592) internal successors, (1205), 916 states have internal predecessors, (1205), 136 states have call successors, (136), 88 states have call predecessors, (136), 102 states have return successors, (155), 139 states have call predecessors, (155), 134 states have call successors, (155) [2021-12-17 21:07:52,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1496 transitions. [2021-12-17 21:07:52,237 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1496 transitions. Word has length 66 [2021-12-17 21:07:52,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:52,237 INFO L470 AbstractCegarLoop]: Abstraction has 1142 states and 1496 transitions. [2021-12-17 21:07:52,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-17 21:07:52,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1496 transitions. [2021-12-17 21:07:52,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-17 21:07:52,238 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:52,239 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:07:52,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 21:07:52,239 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:52,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:52,240 INFO L85 PathProgramCache]: Analyzing trace with hash 864637062, now seen corresponding path program 1 times [2021-12-17 21:07:52,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:52,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130933625] [2021-12-17 21:07:52,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:52,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:52,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:52,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:52,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:07:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:52,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:07:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:52,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:07:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:07:52,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:52,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130933625] [2021-12-17 21:07:52,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130933625] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:52,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:52,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 21:07:52,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441137672] [2021-12-17 21:07:52,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:52,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:07:52,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:52,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:07:52,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:07:52,300 INFO L87 Difference]: Start difference. First operand 1142 states and 1496 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:53,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:53,005 INFO L93 Difference]: Finished difference Result 1438 states and 1943 transitions. [2021-12-17 21:07:53,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 21:07:53,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2021-12-17 21:07:53,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:53,012 INFO L225 Difference]: With dead ends: 1438 [2021-12-17 21:07:53,012 INFO L226 Difference]: Without dead ends: 1321 [2021-12-17 21:07:53,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:07:53,013 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 648 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:53,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 915 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-17 21:07:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2021-12-17 21:07:53,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1258. [2021-12-17 21:07:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1000 states have (on average 1.351) internal successors, (1351), 1015 states have internal predecessors, (1351), 147 states have call successors, (147), 94 states have call predecessors, (147), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2021-12-17 21:07:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1667 transitions. [2021-12-17 21:07:53,072 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1667 transitions. Word has length 68 [2021-12-17 21:07:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:53,074 INFO L470 AbstractCegarLoop]: Abstraction has 1258 states and 1667 transitions. [2021-12-17 21:07:53,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:53,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1667 transitions. [2021-12-17 21:07:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-17 21:07:53,075 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:53,076 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:07:53,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 21:07:53,076 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:53,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:53,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2043544824, now seen corresponding path program 1 times [2021-12-17 21:07:53,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:53,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787413368] [2021-12-17 21:07:53,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:53,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:07:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:07:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:07:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:07:53,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:53,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787413368] [2021-12-17 21:07:53,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787413368] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:53,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:53,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:07:53,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010490863] [2021-12-17 21:07:53,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:53,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:07:53,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:53,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:07:53,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:07:53,194 INFO L87 Difference]: Start difference. First operand 1258 states and 1667 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:53,740 INFO L93 Difference]: Finished difference Result 1556 states and 2118 transitions. [2021-12-17 21:07:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 21:07:53,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2021-12-17 21:07:53,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:53,746 INFO L225 Difference]: With dead ends: 1556 [2021-12-17 21:07:53,746 INFO L226 Difference]: Without dead ends: 1323 [2021-12-17 21:07:53,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:07:53,748 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 544 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:53,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 855 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:07:53,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2021-12-17 21:07:53,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1258. [2021-12-17 21:07:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1000 states have (on average 1.349) internal successors, (1349), 1015 states have internal predecessors, (1349), 147 states have call successors, (147), 94 states have call predecessors, (147), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2021-12-17 21:07:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1665 transitions. [2021-12-17 21:07:53,803 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1665 transitions. Word has length 68 [2021-12-17 21:07:53,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:53,803 INFO L470 AbstractCegarLoop]: Abstraction has 1258 states and 1665 transitions. [2021-12-17 21:07:53,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:53,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1665 transitions. [2021-12-17 21:07:53,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-17 21:07:53,804 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:53,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:07:53,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 21:07:53,805 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:53,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:53,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1167525818, now seen corresponding path program 1 times [2021-12-17 21:07:53,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:53,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887773065] [2021-12-17 21:07:53,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:53,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:07:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:07:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:07:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:07:53,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:53,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887773065] [2021-12-17 21:07:53,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887773065] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:53,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:53,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:07:53,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531279453] [2021-12-17 21:07:53,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:53,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:07:53,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:53,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:07:53,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:07:53,868 INFO L87 Difference]: Start difference. First operand 1258 states and 1665 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:54,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:54,507 INFO L93 Difference]: Finished difference Result 1553 states and 2107 transitions. [2021-12-17 21:07:54,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 21:07:54,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2021-12-17 21:07:54,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:54,512 INFO L225 Difference]: With dead ends: 1553 [2021-12-17 21:07:54,513 INFO L226 Difference]: Without dead ends: 1320 [2021-12-17 21:07:54,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:07:54,514 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 539 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:54,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [561 Valid, 847 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 21:07:54,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2021-12-17 21:07:54,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1258. [2021-12-17 21:07:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1000 states have (on average 1.347) internal successors, (1347), 1015 states have internal predecessors, (1347), 147 states have call successors, (147), 94 states have call predecessors, (147), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2021-12-17 21:07:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1663 transitions. [2021-12-17 21:07:54,575 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1663 transitions. Word has length 68 [2021-12-17 21:07:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:54,575 INFO L470 AbstractCegarLoop]: Abstraction has 1258 states and 1663 transitions. [2021-12-17 21:07:54,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:54,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1663 transitions. [2021-12-17 21:07:54,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-17 21:07:54,579 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:54,579 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:07:54,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 21:07:54,580 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:54,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:54,580 INFO L85 PathProgramCache]: Analyzing trace with hash 370814212, now seen corresponding path program 1 times [2021-12-17 21:07:54,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:54,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118773398] [2021-12-17 21:07:54,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:54,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:54,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:54,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:54,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:07:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:54,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:07:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:54,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:07:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:07:54,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:54,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118773398] [2021-12-17 21:07:54,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118773398] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:54,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:54,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:07:54,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690349525] [2021-12-17 21:07:54,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:54,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:07:54,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:54,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:07:54,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:07:54,693 INFO L87 Difference]: Start difference. First operand 1258 states and 1663 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:55,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:55,183 INFO L93 Difference]: Finished difference Result 1551 states and 2097 transitions. [2021-12-17 21:07:55,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 21:07:55,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2021-12-17 21:07:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:55,190 INFO L225 Difference]: With dead ends: 1551 [2021-12-17 21:07:55,190 INFO L226 Difference]: Without dead ends: 1318 [2021-12-17 21:07:55,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:07:55,192 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 639 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:55,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [661 Valid, 715 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:07:55,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2021-12-17 21:07:55,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1258. [2021-12-17 21:07:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1000 states have (on average 1.345) internal successors, (1345), 1015 states have internal predecessors, (1345), 147 states have call successors, (147), 94 states have call predecessors, (147), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2021-12-17 21:07:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1661 transitions. [2021-12-17 21:07:55,254 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1661 transitions. Word has length 68 [2021-12-17 21:07:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:55,255 INFO L470 AbstractCegarLoop]: Abstraction has 1258 states and 1661 transitions. [2021-12-17 21:07:55,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:55,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1661 transitions. [2021-12-17 21:07:55,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-17 21:07:55,256 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:55,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:07:55,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 21:07:55,256 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:55,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:55,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1657771898, now seen corresponding path program 1 times [2021-12-17 21:07:55,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:55,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337005440] [2021-12-17 21:07:55,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:55,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:07:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:07:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:07:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:07:55,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:55,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337005440] [2021-12-17 21:07:55,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337005440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:55,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:55,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:07:55,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857173466] [2021-12-17 21:07:55,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:55,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:07:55,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:55,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:07:55,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:07:55,322 INFO L87 Difference]: Start difference. First operand 1258 states and 1661 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:55,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:55,837 INFO L93 Difference]: Finished difference Result 1549 states and 2087 transitions. [2021-12-17 21:07:55,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 21:07:55,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2021-12-17 21:07:55,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:55,843 INFO L225 Difference]: With dead ends: 1549 [2021-12-17 21:07:55,843 INFO L226 Difference]: Without dead ends: 1316 [2021-12-17 21:07:55,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:07:55,845 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 535 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:55,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [557 Valid, 840 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:07:55,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2021-12-17 21:07:55,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1258. [2021-12-17 21:07:55,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1000 states have (on average 1.343) internal successors, (1343), 1015 states have internal predecessors, (1343), 147 states have call successors, (147), 94 states have call predecessors, (147), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2021-12-17 21:07:55,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1659 transitions. [2021-12-17 21:07:55,901 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1659 transitions. Word has length 68 [2021-12-17 21:07:55,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:55,902 INFO L470 AbstractCegarLoop]: Abstraction has 1258 states and 1659 transitions. [2021-12-17 21:07:55,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:55,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1659 transitions. [2021-12-17 21:07:55,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-17 21:07:55,903 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:55,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:07:55,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 21:07:55,903 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:55,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:55,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2138852156, now seen corresponding path program 1 times [2021-12-17 21:07:55,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:55,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613430900] [2021-12-17 21:07:55,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:55,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:07:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:07:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:07:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:07:55,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:55,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613430900] [2021-12-17 21:07:55,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613430900] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:55,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:55,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:07:55,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408914615] [2021-12-17 21:07:55,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:55,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:07:55,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:55,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:07:55,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:07:55,999 INFO L87 Difference]: Start difference. First operand 1258 states and 1659 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:56,646 INFO L93 Difference]: Finished difference Result 1618 states and 2194 transitions. [2021-12-17 21:07:56,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 21:07:56,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2021-12-17 21:07:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:56,652 INFO L225 Difference]: With dead ends: 1618 [2021-12-17 21:07:56,653 INFO L226 Difference]: Without dead ends: 1386 [2021-12-17 21:07:56,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-12-17 21:07:56,654 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 370 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:56,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 1229 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 21:07:56,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2021-12-17 21:07:56,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1264. [2021-12-17 21:07:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1006 states have (on average 1.3409542743538767) internal successors, (1349), 1021 states have internal predecessors, (1349), 147 states have call successors, (147), 94 states have call predecessors, (147), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2021-12-17 21:07:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1665 transitions. [2021-12-17 21:07:56,710 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1665 transitions. Word has length 68 [2021-12-17 21:07:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:56,710 INFO L470 AbstractCegarLoop]: Abstraction has 1264 states and 1665 transitions. [2021-12-17 21:07:56,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1665 transitions. [2021-12-17 21:07:56,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-17 21:07:56,711 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:56,712 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:07:56,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 21:07:56,712 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:56,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:56,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1715205434, now seen corresponding path program 1 times [2021-12-17 21:07:56,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:56,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866630955] [2021-12-17 21:07:56,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:56,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:56,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:56,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:56,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:07:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:56,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:07:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:56,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:07:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:07:56,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:56,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866630955] [2021-12-17 21:07:56,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866630955] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:56,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:56,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:07:56,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758264441] [2021-12-17 21:07:56,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:56,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:07:56,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:56,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:07:56,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:07:56,802 INFO L87 Difference]: Start difference. First operand 1264 states and 1665 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:58,070 INFO L93 Difference]: Finished difference Result 2327 states and 3263 transitions. [2021-12-17 21:07:58,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 21:07:58,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2021-12-17 21:07:58,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:58,080 INFO L225 Difference]: With dead ends: 2327 [2021-12-17 21:07:58,080 INFO L226 Difference]: Without dead ends: 2089 [2021-12-17 21:07:58,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-12-17 21:07:58,083 INFO L933 BasicCegarLoop]: 485 mSDtfsCounter, 1371 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:58,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1397 Valid, 1175 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-17 21:07:58,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2021-12-17 21:07:58,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1895. [2021-12-17 21:07:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1533 states have (on average 1.364644487932159) internal successors, (2092), 1557 states have internal predecessors, (2092), 212 states have call successors, (212), 130 states have call predecessors, (212), 148 states have return successors, (271), 209 states have call predecessors, (271), 210 states have call successors, (271) [2021-12-17 21:07:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2575 transitions. [2021-12-17 21:07:58,190 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2575 transitions. Word has length 68 [2021-12-17 21:07:58,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:58,190 INFO L470 AbstractCegarLoop]: Abstraction has 1895 states and 2575 transitions. [2021-12-17 21:07:58,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2575 transitions. [2021-12-17 21:07:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-17 21:07:58,191 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:58,192 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 21:07:58,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 21:07:58,192 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:58,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash 163766987, now seen corresponding path program 1 times [2021-12-17 21:07:58,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:58,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428543086] [2021-12-17 21:07:58,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:58,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:58,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:58,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:58,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:07:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:58,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:07:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:58,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:07:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:58,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 21:07:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:58,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-17 21:07:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:58,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-17 21:07:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 21:07:58,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:58,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428543086] [2021-12-17 21:07:58,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428543086] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:58,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:58,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 21:07:58,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019793042] [2021-12-17 21:07:58,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:58,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 21:07:58,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:58,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 21:07:58,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:07:58,340 INFO L87 Difference]: Start difference. First operand 1895 states and 2575 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 21:07:59,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:59,015 INFO L93 Difference]: Finished difference Result 3072 states and 4126 transitions. [2021-12-17 21:07:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 21:07:59,015 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2021-12-17 21:07:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:59,025 INFO L225 Difference]: With dead ends: 3072 [2021-12-17 21:07:59,026 INFO L226 Difference]: Without dead ends: 2066 [2021-12-17 21:07:59,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-17 21:07:59,029 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 374 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:59,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 1438 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 21:07:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2021-12-17 21:07:59,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1935. [2021-12-17 21:07:59,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1935 states, 1565 states have (on average 1.3552715654952077) internal successors, (2121), 1589 states have internal predecessors, (2121), 212 states have call successors, (212), 130 states have call predecessors, (212), 156 states have return successors, (279), 217 states have call predecessors, (279), 210 states have call successors, (279) [2021-12-17 21:07:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2612 transitions. [2021-12-17 21:07:59,133 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2612 transitions. Word has length 91 [2021-12-17 21:07:59,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:59,134 INFO L470 AbstractCegarLoop]: Abstraction has 1935 states and 2612 transitions. [2021-12-17 21:07:59,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 21:07:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2612 transitions. [2021-12-17 21:07:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-17 21:07:59,135 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:59,136 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 21:07:59,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 21:07:59,136 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:59,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:59,137 INFO L85 PathProgramCache]: Analyzing trace with hash 607667661, now seen corresponding path program 1 times [2021-12-17 21:07:59,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:59,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532223800] [2021-12-17 21:07:59,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:59,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:59,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:59,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:59,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:07:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:59,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:07:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:59,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:07:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:59,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 21:07:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:59,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-17 21:07:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:59,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-17 21:07:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 21:07:59,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:59,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532223800] [2021-12-17 21:07:59,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532223800] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:59,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:59,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:07:59,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317205029] [2021-12-17 21:07:59,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:59,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:07:59,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:59,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:07:59,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:07:59,450 INFO L87 Difference]: Start difference. First operand 1935 states and 2612 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 21:08:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:00,212 INFO L93 Difference]: Finished difference Result 3973 states and 5217 transitions. [2021-12-17 21:08:00,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 21:08:00,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2021-12-17 21:08:00,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:00,226 INFO L225 Difference]: With dead ends: 3973 [2021-12-17 21:08:00,226 INFO L226 Difference]: Without dead ends: 2928 [2021-12-17 21:08:00,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-12-17 21:08:00,230 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 814 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:00,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [836 Valid, 1110 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 21:08:00,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2021-12-17 21:08:00,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2612. [2021-12-17 21:08:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2612 states, 2094 states have (on average 1.3299904489016237) internal successors, (2785), 2131 states have internal predecessors, (2785), 288 states have call successors, (288), 183 states have call predecessors, (288), 228 states have return successors, (392), 300 states have call predecessors, (392), 286 states have call successors, (392) [2021-12-17 21:08:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 3465 transitions. [2021-12-17 21:08:00,390 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 3465 transitions. Word has length 91 [2021-12-17 21:08:00,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:00,391 INFO L470 AbstractCegarLoop]: Abstraction has 2612 states and 3465 transitions. [2021-12-17 21:08:00,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 21:08:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 3465 transitions. [2021-12-17 21:08:00,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-17 21:08:00,394 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:00,394 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 21:08:00,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-17 21:08:00,394 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:00,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:00,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1748137589, now seen corresponding path program 1 times [2021-12-17 21:08:00,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:00,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480274607] [2021-12-17 21:08:00,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:00,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:00,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:00,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:00,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:08:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:00,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:00,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:00,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 21:08:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:00,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-17 21:08:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:00,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-17 21:08:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 21:08:00,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:00,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480274607] [2021-12-17 21:08:00,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480274607] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:00,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:08:00,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:08:00,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054662223] [2021-12-17 21:08:00,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:00,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:08:00,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:00,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:08:00,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:08:00,479 INFO L87 Difference]: Start difference. First operand 2612 states and 3465 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 21:08:01,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:01,257 INFO L93 Difference]: Finished difference Result 6271 states and 8247 transitions. [2021-12-17 21:08:01,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 21:08:01,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2021-12-17 21:08:01,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:01,276 INFO L225 Difference]: With dead ends: 6271 [2021-12-17 21:08:01,277 INFO L226 Difference]: Without dead ends: 4551 [2021-12-17 21:08:01,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-12-17 21:08:01,283 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 734 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:01,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [758 Valid, 838 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 21:08:01,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2021-12-17 21:08:01,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 4331. [2021-12-17 21:08:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4331 states, 3432 states have (on average 1.2960372960372961) internal successors, (4448), 3505 states have internal predecessors, (4448), 481 states have call successors, (481), 317 states have call predecessors, (481), 416 states have return successors, (732), 513 states have call predecessors, (732), 479 states have call successors, (732) [2021-12-17 21:08:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4331 states to 4331 states and 5661 transitions. [2021-12-17 21:08:01,564 INFO L78 Accepts]: Start accepts. Automaton has 4331 states and 5661 transitions. Word has length 91 [2021-12-17 21:08:01,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:01,565 INFO L470 AbstractCegarLoop]: Abstraction has 4331 states and 5661 transitions. [2021-12-17 21:08:01,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 21:08:01,566 INFO L276 IsEmpty]: Start isEmpty. Operand 4331 states and 5661 transitions. [2021-12-17 21:08:01,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-17 21:08:01,569 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:01,569 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 21:08:01,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-17 21:08:01,569 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:01,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:01,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1488991629, now seen corresponding path program 1 times [2021-12-17 21:08:01,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:01,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483702860] [2021-12-17 21:08:01,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:01,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:08:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 21:08:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-17 21:08:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-17 21:08:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,626 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 21:08:01,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:01,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483702860] [2021-12-17 21:08:01,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483702860] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:01,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:08:01,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 21:08:01,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798681126] [2021-12-17 21:08:01,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:01,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:08:01,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:01,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:08:01,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:08:01,628 INFO L87 Difference]: Start difference. First operand 4331 states and 5661 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 21:08:02,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:02,052 INFO L93 Difference]: Finished difference Result 6169 states and 7964 transitions. [2021-12-17 21:08:02,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 21:08:02,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2021-12-17 21:08:02,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:02,071 INFO L225 Difference]: With dead ends: 6169 [2021-12-17 21:08:02,071 INFO L226 Difference]: Without dead ends: 2730 [2021-12-17 21:08:02,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:08:02,080 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 370 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:02,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 847 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:08:02,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2021-12-17 21:08:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 2612. [2021-12-17 21:08:02,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2612 states, 2094 states have (on average 1.3094555873925502) internal successors, (2742), 2131 states have internal predecessors, (2742), 288 states have call successors, (288), 183 states have call predecessors, (288), 228 states have return successors, (392), 300 states have call predecessors, (392), 286 states have call successors, (392) [2021-12-17 21:08:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 3422 transitions. [2021-12-17 21:08:02,206 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 3422 transitions. Word has length 91 [2021-12-17 21:08:02,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:02,206 INFO L470 AbstractCegarLoop]: Abstraction has 2612 states and 3422 transitions. [2021-12-17 21:08:02,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 21:08:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 3422 transitions. [2021-12-17 21:08:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-17 21:08:02,208 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:02,209 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 21:08:02,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-17 21:08:02,209 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:02,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:02,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1449992458, now seen corresponding path program 1 times [2021-12-17 21:08:02,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:02,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957473493] [2021-12-17 21:08:02,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:02,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:02,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:02,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:02,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:08:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:02,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:02,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:02,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 21:08:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:02,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-17 21:08:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:02,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-17 21:08:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 21:08:02,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:02,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957473493] [2021-12-17 21:08:02,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957473493] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:02,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:08:02,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 21:08:02,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962177456] [2021-12-17 21:08:02,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:02,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 21:08:02,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:02,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 21:08:02,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:08:02,323 INFO L87 Difference]: Start difference. First operand 2612 states and 3422 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-17 21:08:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:03,455 INFO L93 Difference]: Finished difference Result 5438 states and 7024 transitions. [2021-12-17 21:08:03,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-17 21:08:03,456 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2021-12-17 21:08:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:03,467 INFO L225 Difference]: With dead ends: 5438 [2021-12-17 21:08:03,467 INFO L226 Difference]: Without dead ends: 3411 [2021-12-17 21:08:03,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2021-12-17 21:08:03,472 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 1279 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:03,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1312 Valid, 1486 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-17 21:08:03,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3411 states. [2021-12-17 21:08:03,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3411 to 3234. [2021-12-17 21:08:03,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 2560 states have (on average 1.278515625) internal successors, (3273), 2605 states have internal predecessors, (3273), 366 states have call successors, (366), 231 states have call predecessors, (366), 306 states have return successors, (525), 400 states have call predecessors, (525), 364 states have call successors, (525) [2021-12-17 21:08:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 4164 transitions. [2021-12-17 21:08:03,650 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 4164 transitions. Word has length 92 [2021-12-17 21:08:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:03,650 INFO L470 AbstractCegarLoop]: Abstraction has 3234 states and 4164 transitions. [2021-12-17 21:08:03,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-17 21:08:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 4164 transitions. [2021-12-17 21:08:03,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-17 21:08:03,652 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:03,653 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:08:03,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-17 21:08:03,653 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:03,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:03,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1292747492, now seen corresponding path program 1 times [2021-12-17 21:08:03,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:03,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446015714] [2021-12-17 21:08:03,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:03,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:08:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:08:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:08:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 21:08:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-17 21:08:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-17 21:08:03,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:03,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446015714] [2021-12-17 21:08:03,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446015714] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:03,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047452866] [2021-12-17 21:08:03,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:03,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:03,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:03,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:03,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 21:08:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:08:03,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-17 21:08:04,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:04,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047452866] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:04,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:04,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 21:08:04,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136592818] [2021-12-17 21:08:04,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:04,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:04,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:04,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:04,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:04,066 INFO L87 Difference]: Start difference. First operand 3234 states and 4164 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:08:04,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:04,278 INFO L93 Difference]: Finished difference Result 4920 states and 6608 transitions. [2021-12-17 21:08:04,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:04,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 110 [2021-12-17 21:08:04,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:04,290 INFO L225 Difference]: With dead ends: 4920 [2021-12-17 21:08:04,290 INFO L226 Difference]: Without dead ends: 3451 [2021-12-17 21:08:04,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:04,295 INFO L933 BasicCegarLoop]: 474 mSDtfsCounter, 150 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:04,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 794 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3451 states. [2021-12-17 21:08:04,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3451 to 3451. [2021-12-17 21:08:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3451 states, 2743 states have (on average 1.2858184469558878) internal successors, (3527), 2789 states have internal predecessors, (3527), 387 states have call successors, (387), 243 states have call predecessors, (387), 319 states have return successors, (557), 421 states have call predecessors, (557), 385 states have call successors, (557) [2021-12-17 21:08:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 4471 transitions. [2021-12-17 21:08:04,498 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 4471 transitions. Word has length 110 [2021-12-17 21:08:04,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:04,498 INFO L470 AbstractCegarLoop]: Abstraction has 3451 states and 4471 transitions. [2021-12-17 21:08:04,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:08:04,499 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 4471 transitions. [2021-12-17 21:08:04,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-12-17 21:08:04,502 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:04,502 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:08:04,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 21:08:04,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-17 21:08:04,723 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:04,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:04,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2129974432, now seen corresponding path program 1 times [2021-12-17 21:08:04,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:04,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450241713] [2021-12-17 21:08:04,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:04,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:04,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:04,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:04,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:08:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:04,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:08:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:04,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:08:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:04,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 21:08:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:04,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:04,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-17 21:08:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:04,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:04,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-17 21:08:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-17 21:08:04,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:04,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450241713] [2021-12-17 21:08:04,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450241713] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:04,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664092771] [2021-12-17 21:08:04,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:04,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:04,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:04,836 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:04,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 21:08:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:04,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:08:04,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-17 21:08:05,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:05,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664092771] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:05,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:05,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-17 21:08:05,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972218200] [2021-12-17 21:08:05,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:05,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:05,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:05,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:05,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:05,266 INFO L87 Difference]: Start difference. First operand 3451 states and 4471 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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) [2021-12-17 21:08:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:05,462 INFO L93 Difference]: Finished difference Result 5572 states and 7572 transitions. [2021-12-17 21:08:05,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:05,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 142 [2021-12-17 21:08:05,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:05,482 INFO L225 Difference]: With dead ends: 5572 [2021-12-17 21:08:05,482 INFO L226 Difference]: Without dead ends: 4486 [2021-12-17 21:08:05,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:05,486 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 237 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:05,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 493 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:05,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2021-12-17 21:08:05,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 4464. [2021-12-17 21:08:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4464 states, 3592 states have (on average 1.3140311804008908) internal successors, (4720), 3649 states have internal predecessors, (4720), 486 states have call successors, (486), 303 states have call predecessors, (486), 384 states have return successors, (698), 514 states have call predecessors, (698), 484 states have call successors, (698) [2021-12-17 21:08:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4464 states to 4464 states and 5904 transitions. [2021-12-17 21:08:05,708 INFO L78 Accepts]: Start accepts. Automaton has 4464 states and 5904 transitions. Word has length 142 [2021-12-17 21:08:05,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:05,708 INFO L470 AbstractCegarLoop]: Abstraction has 4464 states and 5904 transitions. [2021-12-17 21:08:05,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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) [2021-12-17 21:08:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 4464 states and 5904 transitions. [2021-12-17 21:08:05,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-12-17 21:08:05,713 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:05,713 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:08:05,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 21:08:05,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-17 21:08:05,936 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:05,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:05,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1310340904, now seen corresponding path program 1 times [2021-12-17 21:08:05,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:05,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396491811] [2021-12-17 21:08:05,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:05,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:05,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:05,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:05,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:08:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:08:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:08:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 21:08:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 21:08:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-17 21:08:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-17 21:08:06,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:06,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396491811] [2021-12-17 21:08:06,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396491811] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:06,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236986714] [2021-12-17 21:08:06,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:06,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:06,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:06,035 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:06,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 21:08:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:08:06,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-17 21:08:06,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:06,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236986714] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:06,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:06,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-17 21:08:06,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69730556] [2021-12-17 21:08:06,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:06,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:06,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:06,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:06,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:06,438 INFO L87 Difference]: Start difference. First operand 4464 states and 5904 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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) [2021-12-17 21:08:06,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:06,704 INFO L93 Difference]: Finished difference Result 7402 states and 10158 transitions. [2021-12-17 21:08:06,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:06,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 142 [2021-12-17 21:08:06,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:06,725 INFO L225 Difference]: With dead ends: 7402 [2021-12-17 21:08:06,725 INFO L226 Difference]: Without dead ends: 5704 [2021-12-17 21:08:06,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:06,734 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 238 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:06,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 504 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:06,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5704 states. [2021-12-17 21:08:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5704 to 5670. [2021-12-17 21:08:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5670 states, 4608 states have (on average 1.3337673611111112) internal successors, (6146), 4675 states have internal predecessors, (6146), 600 states have call successors, (600), 373 states have call predecessors, (600), 460 states have return successors, (850), 624 states have call predecessors, (850), 598 states have call successors, (850) [2021-12-17 21:08:07,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5670 states to 5670 states and 7596 transitions. [2021-12-17 21:08:07,024 INFO L78 Accepts]: Start accepts. Automaton has 5670 states and 7596 transitions. Word has length 142 [2021-12-17 21:08:07,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:07,024 INFO L470 AbstractCegarLoop]: Abstraction has 5670 states and 7596 transitions. [2021-12-17 21:08:07,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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) [2021-12-17 21:08:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 5670 states and 7596 transitions. [2021-12-17 21:08:07,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-17 21:08:07,030 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:07,030 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:08:07,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 21:08:07,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:07,254 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:07,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:07,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1742334647, now seen corresponding path program 1 times [2021-12-17 21:08:07,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:07,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928297385] [2021-12-17 21:08:07,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:07,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:08:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 21:08:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-17 21:08:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-17 21:08:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-17 21:08:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-17 21:08:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:08:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:08:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-17 21:08:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-17 21:08:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-17 21:08:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-17 21:08:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-17 21:08:07,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:07,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928297385] [2021-12-17 21:08:07,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928297385] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:07,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729588689] [2021-12-17 21:08:07,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:07,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:07,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:07,364 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:07,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 21:08:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:08:07,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-17 21:08:07,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:07,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729588689] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:07,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:07,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-17 21:08:07,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265510380] [2021-12-17 21:08:07,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:07,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:07,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:07,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:07,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:08:07,771 INFO L87 Difference]: Start difference. First operand 5670 states and 7596 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-17 21:08:08,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:08,099 INFO L93 Difference]: Finished difference Result 9995 states and 12911 transitions. [2021-12-17 21:08:08,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:08,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2021-12-17 21:08:08,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:08,123 INFO L225 Difference]: With dead ends: 9995 [2021-12-17 21:08:08,124 INFO L226 Difference]: Without dead ends: 7807 [2021-12-17 21:08:08,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:08:08,132 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 61 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:08,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 641 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:08,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7807 states. [2021-12-17 21:08:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7807 to 7762. [2021-12-17 21:08:08,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7762 states, 6233 states have (on average 1.2985721161559443) internal successors, (8094), 6329 states have internal predecessors, (8094), 834 states have call successors, (834), 555 states have call predecessors, (834), 693 states have return successors, (1157), 880 states have call predecessors, (1157), 832 states have call successors, (1157) [2021-12-17 21:08:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7762 states to 7762 states and 10085 transitions. [2021-12-17 21:08:08,556 INFO L78 Accepts]: Start accepts. Automaton has 7762 states and 10085 transitions. Word has length 163 [2021-12-17 21:08:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:08,557 INFO L470 AbstractCegarLoop]: Abstraction has 7762 states and 10085 transitions. [2021-12-17 21:08:08,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-17 21:08:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 7762 states and 10085 transitions. [2021-12-17 21:08:08,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-17 21:08:08,563 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:08,563 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-17 21:08:08,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 21:08:08,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:08,779 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:08,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:08,780 INFO L85 PathProgramCache]: Analyzing trace with hash -268333173, now seen corresponding path program 1 times [2021-12-17 21:08:08,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:08,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338597528] [2021-12-17 21:08:08,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:08,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:08,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:08,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:08,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:08:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:08,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:08:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:08,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:08:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:08,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-17 21:08:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:08,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-17 21:08:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:08,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:08,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-17 21:08:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:08,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:08,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-17 21:08:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-17 21:08:08,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:08,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338597528] [2021-12-17 21:08:08,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338597528] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:08,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699866023] [2021-12-17 21:08:08,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:08,865 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:08,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:08,866 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:08,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 21:08:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:08,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:08:08,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 21:08:09,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:09,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699866023] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:09,227 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:09,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 21:08:09,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143000976] [2021-12-17 21:08:09,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:09,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:09,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:09,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:09,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:09,228 INFO L87 Difference]: Start difference. First operand 7762 states and 10085 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 21:08:09,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:09,600 INFO L93 Difference]: Finished difference Result 10648 states and 14151 transitions. [2021-12-17 21:08:09,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:09,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 159 [2021-12-17 21:08:09,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:09,626 INFO L225 Difference]: With dead ends: 10648 [2021-12-17 21:08:09,626 INFO L226 Difference]: Without dead ends: 7344 [2021-12-17 21:08:09,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:09,640 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 257 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 354 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 [2021-12-17 21:08:09,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 354 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:09,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7344 states. [2021-12-17 21:08:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7344 to 7344. [2021-12-17 21:08:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7344 states, 5901 states have (on average 1.2702931706490426) internal successors, (7496), 5985 states have internal predecessors, (7496), 770 states have call successors, (770), 537 states have call predecessors, (770), 671 states have return successors, (1043), 824 states have call predecessors, (1043), 768 states have call successors, (1043) [2021-12-17 21:08:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7344 states to 7344 states and 9309 transitions. [2021-12-17 21:08:10,068 INFO L78 Accepts]: Start accepts. Automaton has 7344 states and 9309 transitions. Word has length 159 [2021-12-17 21:08:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:10,068 INFO L470 AbstractCegarLoop]: Abstraction has 7344 states and 9309 transitions. [2021-12-17 21:08:10,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 21:08:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 7344 states and 9309 transitions. [2021-12-17 21:08:10,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-17 21:08:10,074 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:10,074 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-17 21:08:10,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 21:08:10,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:10,291 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:10,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:10,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1542492939, now seen corresponding path program 1 times [2021-12-17 21:08:10,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:10,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681698538] [2021-12-17 21:08:10,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:10,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:08:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:08:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:08:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-17 21:08:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-17 21:08:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 21:08:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-17 21:08:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,378 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-17 21:08:10,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:10,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681698538] [2021-12-17 21:08:10,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681698538] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:10,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804058410] [2021-12-17 21:08:10,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:10,380 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:10,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:10,381 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:10,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 21:08:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 21:08:10,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:10,671 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-17 21:08:10,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:10,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804058410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:10,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:10,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 21:08:10,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106592955] [2021-12-17 21:08:10,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:10,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:10,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:10,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:10,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:10,674 INFO L87 Difference]: Start difference. First operand 7344 states and 9309 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-17 21:08:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:10,977 INFO L93 Difference]: Finished difference Result 10562 states and 13618 transitions. [2021-12-17 21:08:10,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:10,979 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 159 [2021-12-17 21:08:10,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:10,999 INFO L225 Difference]: With dead ends: 10562 [2021-12-17 21:08:10,999 INFO L226 Difference]: Without dead ends: 7676 [2021-12-17 21:08:11,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:11,006 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 296 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:11,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 497 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7676 states. [2021-12-17 21:08:11,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7676 to 7618. [2021-12-17 21:08:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7618 states, 6153 states have (on average 1.2588980984885423) internal successors, (7746), 6235 states have internal predecessors, (7746), 772 states have call successors, (772), 555 states have call predecessors, (772), 691 states have return successors, (1041), 830 states have call predecessors, (1041), 770 states have call successors, (1041) [2021-12-17 21:08:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7618 states to 7618 states and 9559 transitions. [2021-12-17 21:08:11,403 INFO L78 Accepts]: Start accepts. Automaton has 7618 states and 9559 transitions. Word has length 159 [2021-12-17 21:08:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:11,403 INFO L470 AbstractCegarLoop]: Abstraction has 7618 states and 9559 transitions. [2021-12-17 21:08:11,403 INFO L471 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-17 21:08:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 7618 states and 9559 transitions. [2021-12-17 21:08:11,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-17 21:08:11,408 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:11,408 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-17 21:08:11,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 21:08:11,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:11,630 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:11,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:11,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1281698088, now seen corresponding path program 1 times [2021-12-17 21:08:11,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:11,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398505136] [2021-12-17 21:08:11,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:11,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:11,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:11,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:11,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:08:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:11,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:08:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:11,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:08:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:11,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 21:08:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:11,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-17 21:08:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:11,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:11,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-17 21:08:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:11,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:11,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-17 21:08:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-12-17 21:08:11,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:11,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398505136] [2021-12-17 21:08:11,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398505136] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:11,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749775198] [2021-12-17 21:08:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:11,720 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:11,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:11,721 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:11,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 21:08:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:11,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 21:08:11,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-17 21:08:12,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:12,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749775198] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:12,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:12,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 21:08:12,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952720748] [2021-12-17 21:08:12,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:12,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:12,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:12,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:12,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:12,088 INFO L87 Difference]: Start difference. First operand 7618 states and 9559 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-17 21:08:12,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:12,460 INFO L93 Difference]: Finished difference Result 13831 states and 17886 transitions. [2021-12-17 21:08:12,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:12,460 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), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 160 [2021-12-17 21:08:12,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:12,492 INFO L225 Difference]: With dead ends: 13831 [2021-12-17 21:08:12,493 INFO L226 Difference]: Without dead ends: 10671 [2021-12-17 21:08:12,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:12,505 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 283 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:12,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 527 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:12,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10671 states. [2021-12-17 21:08:13,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10671 to 10615. [2021-12-17 21:08:13,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10615 states, 8715 states have (on average 1.2707974756167528) internal successors, (11075), 8816 states have internal predecessors, (11075), 1015 states have call successors, (1015), 735 states have call predecessors, (1015), 883 states have return successors, (1532), 1067 states have call predecessors, (1532), 1013 states have call successors, (1532) [2021-12-17 21:08:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10615 states to 10615 states and 13622 transitions. [2021-12-17 21:08:13,179 INFO L78 Accepts]: Start accepts. Automaton has 10615 states and 13622 transitions. Word has length 160 [2021-12-17 21:08:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:13,179 INFO L470 AbstractCegarLoop]: Abstraction has 10615 states and 13622 transitions. [2021-12-17 21:08:13,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-17 21:08:13,179 INFO L276 IsEmpty]: Start isEmpty. Operand 10615 states and 13622 transitions. [2021-12-17 21:08:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-17 21:08:13,188 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:13,188 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-17 21:08:13,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 21:08:13,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:13,413 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:13,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:13,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1321921686, now seen corresponding path program 1 times [2021-12-17 21:08:13,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:13,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508949417] [2021-12-17 21:08:13,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:13,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:08:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:08:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:08:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 21:08:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-17 21:08:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-17 21:08:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-17 21:08:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-17 21:08:13,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:13,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508949417] [2021-12-17 21:08:13,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508949417] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:13,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:08:13,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 21:08:13,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021358087] [2021-12-17 21:08:13,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:13,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 21:08:13,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:13,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 21:08:13,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 21:08:13,480 INFO L87 Difference]: Start difference. First operand 10615 states and 13622 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-17 21:08:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:14,204 INFO L93 Difference]: Finished difference Result 16266 states and 21141 transitions. [2021-12-17 21:08:14,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 21:08:14,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 160 [2021-12-17 21:08:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:14,236 INFO L225 Difference]: With dead ends: 16266 [2021-12-17 21:08:14,236 INFO L226 Difference]: Without dead ends: 10108 [2021-12-17 21:08:14,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:08:14,254 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 411 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:14,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 656 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:08:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10108 states. [2021-12-17 21:08:14,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10108 to 9432. [2021-12-17 21:08:14,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9432 states, 7707 states have (on average 1.2680679901388348) internal successors, (9773), 7827 states have internal predecessors, (9773), 890 states have call successors, (890), 643 states have call predecessors, (890), 833 states have return successors, (1380), 964 states have call predecessors, (1380), 888 states have call successors, (1380) [2021-12-17 21:08:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9432 states to 9432 states and 12043 transitions. [2021-12-17 21:08:14,781 INFO L78 Accepts]: Start accepts. Automaton has 9432 states and 12043 transitions. Word has length 160 [2021-12-17 21:08:14,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:14,781 INFO L470 AbstractCegarLoop]: Abstraction has 9432 states and 12043 transitions. [2021-12-17 21:08:14,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-17 21:08:14,782 INFO L276 IsEmpty]: Start isEmpty. Operand 9432 states and 12043 transitions. [2021-12-17 21:08:14,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-17 21:08:14,788 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:14,789 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-17 21:08:14,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-17 21:08:14,789 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:14,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:14,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1755889720, now seen corresponding path program 1 times [2021-12-17 21:08:14,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:14,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972710981] [2021-12-17 21:08:14,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:14,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:08:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:08:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:08:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:08:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:08:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-17 21:08:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-17 21:08:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-17 21:08:14,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:14,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972710981] [2021-12-17 21:08:14,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972710981] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:14,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297158624] [2021-12-17 21:08:14,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:14,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:14,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:14,888 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:14,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 21:08:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 21:08:14,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 21:08:15,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:15,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297158624] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:15,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:15,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 21:08:15,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250722228] [2021-12-17 21:08:15,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:15,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:15,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:15,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:15,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:15,243 INFO L87 Difference]: Start difference. First operand 9432 states and 12043 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 21:08:15,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:15,550 INFO L93 Difference]: Finished difference Result 13116 states and 17348 transitions. [2021-12-17 21:08:15,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:15,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 162 [2021-12-17 21:08:15,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:15,580 INFO L225 Difference]: With dead ends: 13116 [2021-12-17 21:08:15,581 INFO L226 Difference]: Without dead ends: 9456 [2021-12-17 21:08:15,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:15,595 INFO L933 BasicCegarLoop]: 431 mSDtfsCounter, 126 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:15,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 732 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:15,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9456 states. [2021-12-17 21:08:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9456 to 9432. [2021-12-17 21:08:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9432 states, 7707 states have (on average 1.2506811989100817) internal successors, (9639), 7827 states have internal predecessors, (9639), 890 states have call successors, (890), 643 states have call predecessors, (890), 833 states have return successors, (1380), 964 states have call predecessors, (1380), 888 states have call successors, (1380) [2021-12-17 21:08:16,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9432 states to 9432 states and 11909 transitions. [2021-12-17 21:08:16,159 INFO L78 Accepts]: Start accepts. Automaton has 9432 states and 11909 transitions. Word has length 162 [2021-12-17 21:08:16,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:16,160 INFO L470 AbstractCegarLoop]: Abstraction has 9432 states and 11909 transitions. [2021-12-17 21:08:16,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 21:08:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 9432 states and 11909 transitions. [2021-12-17 21:08:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-17 21:08:16,166 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:16,167 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-17 21:08:16,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 21:08:16,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-17 21:08:16,391 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:16,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:16,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1035796568, now seen corresponding path program 1 times [2021-12-17 21:08:16,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:16,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889980917] [2021-12-17 21:08:16,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:16,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:08:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:08:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:08:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:08:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:08:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-17 21:08:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-17 21:08:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-17 21:08:16,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:16,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889980917] [2021-12-17 21:08:16,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889980917] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:16,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93296281] [2021-12-17 21:08:16,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:16,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:16,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:16,498 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:16,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 21:08:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:08:16,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-17 21:08:16,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:16,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93296281] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:16,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:16,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 21:08:16,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266460679] [2021-12-17 21:08:16,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:16,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:16,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:16,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:16,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:16,824 INFO L87 Difference]: Start difference. First operand 9432 states and 11909 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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) [2021-12-17 21:08:17,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:17,262 INFO L93 Difference]: Finished difference Result 14770 states and 19201 transitions. [2021-12-17 21:08:17,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:17,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 162 [2021-12-17 21:08:17,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:17,293 INFO L225 Difference]: With dead ends: 14770 [2021-12-17 21:08:17,293 INFO L226 Difference]: Without dead ends: 9796 [2021-12-17 21:08:17,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:17,307 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 271 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 351 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 [2021-12-17 21:08:17,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 351 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:17,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9796 states. [2021-12-17 21:08:17,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9796 to 9192. [2021-12-17 21:08:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9192 states, 7529 states have (on average 1.2279187143046886) internal successors, (9245), 7645 states have internal predecessors, (9245), 852 states have call successors, (852), 625 states have call predecessors, (852), 809 states have return successors, (1254), 924 states have call predecessors, (1254), 850 states have call successors, (1254) [2021-12-17 21:08:17,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9192 states to 9192 states and 11351 transitions. [2021-12-17 21:08:17,895 INFO L78 Accepts]: Start accepts. Automaton has 9192 states and 11351 transitions. Word has length 162 [2021-12-17 21:08:17,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:17,895 INFO L470 AbstractCegarLoop]: Abstraction has 9192 states and 11351 transitions. [2021-12-17 21:08:17,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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) [2021-12-17 21:08:17,896 INFO L276 IsEmpty]: Start isEmpty. Operand 9192 states and 11351 transitions. [2021-12-17 21:08:17,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-17 21:08:17,901 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:17,901 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-17 21:08:17,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-17 21:08:18,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-17 21:08:18,102 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:18,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:18,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1007655319, now seen corresponding path program 1 times [2021-12-17 21:08:18,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:18,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936031928] [2021-12-17 21:08:18,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:18,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:08:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:08:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:08:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 21:08:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-17 21:08:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-17 21:08:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-17 21:08:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-12-17 21:08:18,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:18,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936031928] [2021-12-17 21:08:18,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936031928] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:18,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43673035] [2021-12-17 21:08:18,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:18,205 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:18,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:18,206 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:18,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-17 21:08:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:08:18,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:18,536 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-17 21:08:18,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:18,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43673035] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:18,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:18,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 21:08:18,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665251226] [2021-12-17 21:08:18,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:18,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:18,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:18,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:18,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:18,538 INFO L87 Difference]: Start difference. First operand 9192 states and 11351 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 21:08:19,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:19,088 INFO L93 Difference]: Finished difference Result 17758 states and 22315 transitions. [2021-12-17 21:08:19,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:19,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2021-12-17 21:08:19,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:19,116 INFO L225 Difference]: With dead ends: 17758 [2021-12-17 21:08:19,116 INFO L226 Difference]: Without dead ends: 13024 [2021-12-17 21:08:19,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:19,124 INFO L933 BasicCegarLoop]: 463 mSDtfsCounter, 134 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:19,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 778 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:19,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13024 states. [2021-12-17 21:08:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13024 to 13022. [2021-12-17 21:08:19,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13022 states, 10794 states have (on average 1.2317954419121735) internal successors, (13296), 10953 states have internal predecessors, (13296), 1155 states have call successors, (1155), 845 states have call predecessors, (1155), 1071 states have return successors, (1871), 1227 states have call predecessors, (1871), 1153 states have call successors, (1871) [2021-12-17 21:08:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13022 states to 13022 states and 16322 transitions. [2021-12-17 21:08:19,721 INFO L78 Accepts]: Start accepts. Automaton has 13022 states and 16322 transitions. Word has length 163 [2021-12-17 21:08:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:19,722 INFO L470 AbstractCegarLoop]: Abstraction has 13022 states and 16322 transitions. [2021-12-17 21:08:19,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 21:08:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 13022 states and 16322 transitions. [2021-12-17 21:08:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-17 21:08:19,729 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:19,729 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-17 21:08:19,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-17 21:08:19,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-17 21:08:19,931 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:19,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1197312820, now seen corresponding path program 1 times [2021-12-17 21:08:19,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:19,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703110730] [2021-12-17 21:08:19,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:19,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:08:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:20,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:08:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:20,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:08:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:20,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:08:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:20,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:08:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:20,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:20,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-17 21:08:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:20,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:20,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-17 21:08:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:20,024 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-17 21:08:20,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:20,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703110730] [2021-12-17 21:08:20,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703110730] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:20,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057036278] [2021-12-17 21:08:20,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:20,025 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:20,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:20,028 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:20,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-17 21:08:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:20,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 21:08:20,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-17 21:08:20,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:20,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057036278] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:20,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:20,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-17 21:08:20,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827829814] [2021-12-17 21:08:20,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:20,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 21:08:20,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:20,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 21:08:20,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-17 21:08:20,409 INFO L87 Difference]: Start difference. First operand 13022 states and 16322 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:08:21,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:21,284 INFO L93 Difference]: Finished difference Result 21582 states and 27326 transitions. [2021-12-17 21:08:21,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 21:08:21,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 164 [2021-12-17 21:08:21,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:21,310 INFO L225 Difference]: With dead ends: 21582 [2021-12-17 21:08:21,310 INFO L226 Difference]: Without dead ends: 13022 [2021-12-17 21:08:21,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:08:21,321 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 362 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:21,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 579 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:08:21,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13022 states. [2021-12-17 21:08:21,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13022 to 13022. [2021-12-17 21:08:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13022 states, 10794 states have (on average 1.2169723920696682) internal successors, (13136), 10953 states have internal predecessors, (13136), 1155 states have call successors, (1155), 845 states have call predecessors, (1155), 1071 states have return successors, (1871), 1227 states have call predecessors, (1871), 1153 states have call successors, (1871) [2021-12-17 21:08:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13022 states to 13022 states and 16162 transitions. [2021-12-17 21:08:21,953 INFO L78 Accepts]: Start accepts. Automaton has 13022 states and 16162 transitions. Word has length 164 [2021-12-17 21:08:21,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:21,953 INFO L470 AbstractCegarLoop]: Abstraction has 13022 states and 16162 transitions. [2021-12-17 21:08:21,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:08:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 13022 states and 16162 transitions. [2021-12-17 21:08:21,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-17 21:08:21,960 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:21,960 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-17 21:08:21,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-17 21:08:22,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-17 21:08:22,161 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:22,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:22,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2005019274, now seen corresponding path program 1 times [2021-12-17 21:08:22,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:22,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401636013] [2021-12-17 21:08:22,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:22,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:22,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:22,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:22,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:08:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:22,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:08:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:22,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:08:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:22,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:08:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:22,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:08:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:22,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:22,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-17 21:08:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:22,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:22,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-17 21:08:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-17 21:08:22,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:22,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401636013] [2021-12-17 21:08:22,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401636013] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:22,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501322810] [2021-12-17 21:08:22,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:22,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:22,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:22,260 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:22,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-17 21:08:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:22,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 21:08:22,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:22,606 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-17 21:08:22,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:22,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501322810] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:22,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:22,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-17 21:08:22,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374609562] [2021-12-17 21:08:22,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:22,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 21:08:22,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:22,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 21:08:22,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-17 21:08:22,608 INFO L87 Difference]: Start difference. First operand 13022 states and 16162 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:08:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:23,372 INFO L93 Difference]: Finished difference Result 22038 states and 27976 transitions. [2021-12-17 21:08:23,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 21:08:23,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 164 [2021-12-17 21:08:23,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:23,399 INFO L225 Difference]: With dead ends: 22038 [2021-12-17 21:08:23,399 INFO L226 Difference]: Without dead ends: 13478 [2021-12-17 21:08:23,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-17 21:08:23,416 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 390 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:23,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 595 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:08:23,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13478 states. [2021-12-17 21:08:23,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13478 to 13022. [2021-12-17 21:08:23,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13022 states, 10794 states have (on average 1.1951083935519733) internal successors, (12900), 10953 states have internal predecessors, (12900), 1155 states have call successors, (1155), 845 states have call predecessors, (1155), 1071 states have return successors, (1871), 1227 states have call predecessors, (1871), 1153 states have call successors, (1871) [2021-12-17 21:08:23,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13022 states to 13022 states and 15926 transitions. [2021-12-17 21:08:23,991 INFO L78 Accepts]: Start accepts. Automaton has 13022 states and 15926 transitions. Word has length 164 [2021-12-17 21:08:23,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:23,991 INFO L470 AbstractCegarLoop]: Abstraction has 13022 states and 15926 transitions. [2021-12-17 21:08:23,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:08:23,991 INFO L276 IsEmpty]: Start isEmpty. Operand 13022 states and 15926 transitions. [2021-12-17 21:08:23,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-17 21:08:23,998 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:23,998 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-17 21:08:24,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-17 21:08:24,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-17 21:08:24,199 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:24,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:24,200 INFO L85 PathProgramCache]: Analyzing trace with hash 283016588, now seen corresponding path program 1 times [2021-12-17 21:08:24,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:24,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152684695] [2021-12-17 21:08:24,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:24,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:24,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:24,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:24,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:08:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:24,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:08:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:24,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:08:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:24,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:08:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:24,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:08:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:24,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:24,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-17 21:08:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:24,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:24,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-17 21:08:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-17 21:08:24,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:24,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152684695] [2021-12-17 21:08:24,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152684695] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:24,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743862140] [2021-12-17 21:08:24,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:24,284 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:24,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:24,285 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:24,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-17 21:08:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:24,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 21:08:24,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-17 21:08:24,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:24,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743862140] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:24,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:24,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-17 21:08:24,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288953802] [2021-12-17 21:08:24,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:24,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 21:08:24,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:24,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 21:08:24,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-17 21:08:24,647 INFO L87 Difference]: Start difference. First operand 13022 states and 15926 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:08:25,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:25,595 INFO L93 Difference]: Finished difference Result 21586 states and 26577 transitions. [2021-12-17 21:08:25,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 21:08:25,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 164 [2021-12-17 21:08:25,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:25,630 INFO L225 Difference]: With dead ends: 21586 [2021-12-17 21:08:25,631 INFO L226 Difference]: Without dead ends: 13022 [2021-12-17 21:08:25,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:08:25,649 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 353 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:25,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 567 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:08:25,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13022 states. [2021-12-17 21:08:26,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13022 to 13022. [2021-12-17 21:08:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13022 states, 10794 states have (on average 1.1743561237724662) internal successors, (12676), 10953 states have internal predecessors, (12676), 1155 states have call successors, (1155), 845 states have call predecessors, (1155), 1071 states have return successors, (1837), 1227 states have call predecessors, (1837), 1153 states have call successors, (1837) [2021-12-17 21:08:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13022 states to 13022 states and 15668 transitions. [2021-12-17 21:08:26,240 INFO L78 Accepts]: Start accepts. Automaton has 13022 states and 15668 transitions. Word has length 164 [2021-12-17 21:08:26,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:26,241 INFO L470 AbstractCegarLoop]: Abstraction has 13022 states and 15668 transitions. [2021-12-17 21:08:26,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:08:26,241 INFO L276 IsEmpty]: Start isEmpty. Operand 13022 states and 15668 transitions. [2021-12-17 21:08:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-17 21:08:26,247 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:26,247 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-17 21:08:26,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-17 21:08:26,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:26,448 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:26,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:26,448 INFO L85 PathProgramCache]: Analyzing trace with hash -999155698, now seen corresponding path program 1 times [2021-12-17 21:08:26,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:26,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743512983] [2021-12-17 21:08:26,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:26,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:26,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:26,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:26,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:08:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:26,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:08:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:26,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:08:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:26,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:08:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:26,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:08:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:26,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:26,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-17 21:08:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:26,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:26,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-17 21:08:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-17 21:08:26,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:26,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743512983] [2021-12-17 21:08:26,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743512983] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:26,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891832650] [2021-12-17 21:08:26,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:26,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:26,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:26,539 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:26,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-17 21:08:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:26,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 21:08:26,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:26,848 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-17 21:08:26,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:26,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891832650] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:26,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:26,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-17 21:08:26,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519938268] [2021-12-17 21:08:26,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:26,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 21:08:26,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:26,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 21:08:26,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:08:26,850 INFO L87 Difference]: Start difference. First operand 13022 states and 15668 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:08:27,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:27,540 INFO L93 Difference]: Finished difference Result 21708 states and 26506 transitions. [2021-12-17 21:08:27,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 21:08:27,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 164 [2021-12-17 21:08:27,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:27,566 INFO L225 Difference]: With dead ends: 21708 [2021-12-17 21:08:27,566 INFO L226 Difference]: Without dead ends: 13146 [2021-12-17 21:08:27,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:08:27,580 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 49 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:27,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 1254 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:27,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13146 states. [2021-12-17 21:08:28,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13146 to 12910. [2021-12-17 21:08:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12910 states, 10694 states have (on average 1.1615859360389003) internal successors, (12422), 10845 states have internal predecessors, (12422), 1155 states have call successors, (1155), 845 states have call predecessors, (1155), 1059 states have return successors, (1749), 1223 states have call predecessors, (1749), 1153 states have call successors, (1749) [2021-12-17 21:08:28,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12910 states to 12910 states and 15326 transitions. [2021-12-17 21:08:28,174 INFO L78 Accepts]: Start accepts. Automaton has 12910 states and 15326 transitions. Word has length 164 [2021-12-17 21:08:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:28,174 INFO L470 AbstractCegarLoop]: Abstraction has 12910 states and 15326 transitions. [2021-12-17 21:08:28,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:08:28,174 INFO L276 IsEmpty]: Start isEmpty. Operand 12910 states and 15326 transitions. [2021-12-17 21:08:28,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-17 21:08:28,180 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:28,180 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-17 21:08:28,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-17 21:08:28,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:28,381 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:28,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:28,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1766359060, now seen corresponding path program 1 times [2021-12-17 21:08:28,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:28,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017614725] [2021-12-17 21:08:28,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:28,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:28,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:28,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:28,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:08:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:28,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:08:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:28,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:08:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:28,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:08:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:28,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:08:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:28,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:28,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-17 21:08:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:28,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:28,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-17 21:08:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-12-17 21:08:28,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:28,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017614725] [2021-12-17 21:08:28,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017614725] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:28,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105598540] [2021-12-17 21:08:28,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:28,478 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:28,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:28,479 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:28,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-17 21:08:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:28,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 21:08:28,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-17 21:08:28,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:28,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105598540] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:28,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:28,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-17 21:08:28,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205480520] [2021-12-17 21:08:28,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:28,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 21:08:28,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:28,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 21:08:28,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:08:28,849 INFO L87 Difference]: Start difference. First operand 12910 states and 15326 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:08:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:29,402 INFO L93 Difference]: Finished difference Result 18463 states and 22082 transitions. [2021-12-17 21:08:29,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 21:08:29,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 164 [2021-12-17 21:08:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:29,427 INFO L225 Difference]: With dead ends: 18463 [2021-12-17 21:08:29,427 INFO L226 Difference]: Without dead ends: 10010 [2021-12-17 21:08:29,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:08:29,437 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 10 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:29,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1239 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:29,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10010 states. [2021-12-17 21:08:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10010 to 9978. [2021-12-17 21:08:29,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9978 states, 8205 states have (on average 1.1614868982327848) internal successors, (9530), 8323 states have internal predecessors, (9530), 916 states have call successors, (916), 669 states have call predecessors, (916), 855 states have return successors, (1300), 988 states have call predecessors, (1300), 914 states have call successors, (1300) [2021-12-17 21:08:29,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9978 states to 9978 states and 11746 transitions. [2021-12-17 21:08:29,868 INFO L78 Accepts]: Start accepts. Automaton has 9978 states and 11746 transitions. Word has length 164 [2021-12-17 21:08:29,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:29,868 INFO L470 AbstractCegarLoop]: Abstraction has 9978 states and 11746 transitions. [2021-12-17 21:08:29,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:08:29,869 INFO L276 IsEmpty]: Start isEmpty. Operand 9978 states and 11746 transitions. [2021-12-17 21:08:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-12-17 21:08:29,874 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:29,874 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:08:29,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-17 21:08:30,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:30,075 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:30,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:30,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1870747336, now seen corresponding path program 1 times [2021-12-17 21:08:30,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:30,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532498550] [2021-12-17 21:08:30,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:30,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:08:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 21:08:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-17 21:08:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-17 21:08:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-17 21:08:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-17 21:08:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:08:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 21:08:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 21:08:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-17 21:08:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:08:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-17 21:08:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-17 21:08:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-12-17 21:08:30,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:30,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532498550] [2021-12-17 21:08:30,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532498550] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:30,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632756295] [2021-12-17 21:08:30,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:30,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:30,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:30,185 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:30,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-17 21:08:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:30,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:08:30,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:30,601 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-17 21:08:30,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:30,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632756295] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:30,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:30,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-17 21:08:30,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530023504] [2021-12-17 21:08:30,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:30,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:30,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:30,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:30,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:08:30,603 INFO L87 Difference]: Start difference. First operand 9978 states and 11746 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-17 21:08:31,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:31,121 INFO L93 Difference]: Finished difference Result 18846 states and 22484 transitions. [2021-12-17 21:08:31,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:31,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 195 [2021-12-17 21:08:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:31,149 INFO L225 Difference]: With dead ends: 18846 [2021-12-17 21:08:31,149 INFO L226 Difference]: Without dead ends: 14412 [2021-12-17 21:08:31,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:08:31,159 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 52 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:31,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 615 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:31,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14412 states. [2021-12-17 21:08:31,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14412 to 14402. [2021-12-17 21:08:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14402 states, 11642 states have (on average 1.1721353719292218) internal successors, (13646), 11820 states have internal predecessors, (13646), 1416 states have call successors, (1416), 1033 states have call predecessors, (1416), 1342 states have return successors, (1993), 1551 states have call predecessors, (1993), 1414 states have call successors, (1993) [2021-12-17 21:08:31,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14402 states to 14402 states and 17055 transitions. [2021-12-17 21:08:31,849 INFO L78 Accepts]: Start accepts. Automaton has 14402 states and 17055 transitions. Word has length 195 [2021-12-17 21:08:31,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:31,849 INFO L470 AbstractCegarLoop]: Abstraction has 14402 states and 17055 transitions. [2021-12-17 21:08:31,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-17 21:08:31,850 INFO L276 IsEmpty]: Start isEmpty. Operand 14402 states and 17055 transitions. [2021-12-17 21:08:31,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-12-17 21:08:31,857 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:31,857 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:08:31,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-17 21:08:32,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-12-17 21:08:32,058 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:32,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:32,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1526826682, now seen corresponding path program 1 times [2021-12-17 21:08:32,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:32,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499720063] [2021-12-17 21:08:32,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:32,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:08:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 21:08:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-17 21:08:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-17 21:08:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-17 21:08:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-17 21:08:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:08:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 21:08:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 21:08:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-17 21:08:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:08:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-17 21:08:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-17 21:08:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,172 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-12-17 21:08:32,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:32,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499720063] [2021-12-17 21:08:32,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499720063] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:32,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584501334] [2021-12-17 21:08:32,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:32,173 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:32,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:32,174 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:32,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-17 21:08:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:32,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:08:32,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:32,574 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-12-17 21:08:32,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:32,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584501334] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:32,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:32,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-17 21:08:32,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675167125] [2021-12-17 21:08:32,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:32,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:32,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:32,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:32,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:08:32,575 INFO L87 Difference]: Start difference. First operand 14402 states and 17055 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2021-12-17 21:08:33,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:33,106 INFO L93 Difference]: Finished difference Result 20932 states and 25295 transitions. [2021-12-17 21:08:33,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:33,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 195 [2021-12-17 21:08:33,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:33,119 INFO L225 Difference]: With dead ends: 20932 [2021-12-17 21:08:33,119 INFO L226 Difference]: Without dead ends: 5533 [2021-12-17 21:08:33,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:08:33,136 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 192 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:33,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 296 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5533 states. [2021-12-17 21:08:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5533 to 5533. [2021-12-17 21:08:33,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5533 states, 4756 states have (on average 1.1248948696383516) internal successors, (5350), 4811 states have internal predecessors, (5350), 408 states have call successors, (408), 304 states have call predecessors, (408), 368 states have return successors, (600), 418 states have call predecessors, (600), 408 states have call successors, (600) [2021-12-17 21:08:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5533 states to 5533 states and 6358 transitions. [2021-12-17 21:08:33,541 INFO L78 Accepts]: Start accepts. Automaton has 5533 states and 6358 transitions. Word has length 195 [2021-12-17 21:08:33,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:33,541 INFO L470 AbstractCegarLoop]: Abstraction has 5533 states and 6358 transitions. [2021-12-17 21:08:33,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2021-12-17 21:08:33,542 INFO L276 IsEmpty]: Start isEmpty. Operand 5533 states and 6358 transitions. [2021-12-17 21:08:33,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-12-17 21:08:33,545 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:33,545 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-17 21:08:33,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-17 21:08:33,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:33,746 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:33,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:33,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2143980507, now seen corresponding path program 1 times [2021-12-17 21:08:33,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:33,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564165628] [2021-12-17 21:08:33,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:33,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:33,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:33,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:33,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:08:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:33,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:08:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:33,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:08:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:33,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 21:08:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:33,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:33,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-17 21:08:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:33,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 21:08:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:33,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:33,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-17 21:08:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:33,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:33,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-12-17 21:08:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-12-17 21:08:33,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:33,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564165628] [2021-12-17 21:08:33,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564165628] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:33,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469991983] [2021-12-17 21:08:33,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:33,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:33,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:33,834 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:33,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-17 21:08:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:33,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:08:33,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-17 21:08:34,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:34,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469991983] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:34,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:34,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 21:08:34,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707982329] [2021-12-17 21:08:34,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:34,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:34,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:34,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:34,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:34,192 INFO L87 Difference]: Start difference. First operand 5533 states and 6358 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-17 21:08:34,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:34,358 INFO L93 Difference]: Finished difference Result 7469 states and 8560 transitions. [2021-12-17 21:08:34,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:34,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 199 [2021-12-17 21:08:34,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:34,363 INFO L225 Difference]: With dead ends: 7469 [2021-12-17 21:08:34,363 INFO L226 Difference]: Without dead ends: 1717 [2021-12-17 21:08:34,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:34,369 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 123 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:34,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 400 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:34,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2021-12-17 21:08:34,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1717. [2021-12-17 21:08:34,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1717 states, 1464 states have (on average 1.0969945355191257) internal successors, (1606), 1475 states have internal predecessors, (1606), 144 states have call successors, (144), 100 states have call predecessors, (144), 108 states have return successors, (159), 142 states have call predecessors, (159), 144 states have call successors, (159) [2021-12-17 21:08:34,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 1909 transitions. [2021-12-17 21:08:34,456 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 1909 transitions. Word has length 199 [2021-12-17 21:08:34,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:34,457 INFO L470 AbstractCegarLoop]: Abstraction has 1717 states and 1909 transitions. [2021-12-17 21:08:34,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-17 21:08:34,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 1909 transitions. [2021-12-17 21:08:34,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-12-17 21:08:34,459 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:34,459 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-17 21:08:34,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-17 21:08:34,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:34,659 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:34,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:34,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1306252531, now seen corresponding path program 1 times [2021-12-17 21:08:34,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:34,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092876878] [2021-12-17 21:08:34,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:34,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:34,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:34,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:34,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:08:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:34,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:08:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:34,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:08:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:34,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-17 21:08:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:34,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 21:08:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:34,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:34,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 21:08:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:34,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:34,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-17 21:08:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:34,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:34,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-17 21:08:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 53 proven. 41 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-17 21:08:34,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:34,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092876878] [2021-12-17 21:08:34,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092876878] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:34,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182286162] [2021-12-17 21:08:34,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:34,755 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:34,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:34,756 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:34,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-17 21:08:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:34,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 21:08:34,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-17 21:08:35,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:35,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182286162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:35,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:35,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-17 21:08:35,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810026585] [2021-12-17 21:08:35,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:35,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:35,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:35,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:35,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:08:35,144 INFO L87 Difference]: Start difference. First operand 1717 states and 1909 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-17 21:08:35,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:35,215 INFO L93 Difference]: Finished difference Result 3061 states and 3428 transitions. [2021-12-17 21:08:35,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:35,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 200 [2021-12-17 21:08:35,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:35,220 INFO L225 Difference]: With dead ends: 3061 [2021-12-17 21:08:35,220 INFO L226 Difference]: Without dead ends: 1717 [2021-12-17 21:08:35,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:08:35,222 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 91 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:35,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 354 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:35,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2021-12-17 21:08:35,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1717. [2021-12-17 21:08:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1717 states, 1464 states have (on average 1.0860655737704918) internal successors, (1590), 1475 states have internal predecessors, (1590), 144 states have call successors, (144), 100 states have call predecessors, (144), 108 states have return successors, (159), 142 states have call predecessors, (159), 144 states have call successors, (159) [2021-12-17 21:08:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 1893 transitions. [2021-12-17 21:08:35,293 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 1893 transitions. Word has length 200 [2021-12-17 21:08:35,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:35,293 INFO L470 AbstractCegarLoop]: Abstraction has 1717 states and 1893 transitions. [2021-12-17 21:08:35,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-17 21:08:35,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 1893 transitions. [2021-12-17 21:08:35,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2021-12-17 21:08:35,295 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:35,295 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-17 21:08:35,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-17 21:08:35,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:35,495 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:35,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:35,496 INFO L85 PathProgramCache]: Analyzing trace with hash -78871575, now seen corresponding path program 1 times [2021-12-17 21:08:35,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:35,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867063417] [2021-12-17 21:08:35,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:35,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:35,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:35,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:35,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:08:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:35,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:08:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:35,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:08:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:35,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-17 21:08:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:35,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 21:08:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:35,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:35,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 21:08:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:35,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:35,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-17 21:08:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:35,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:35,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-17 21:08:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:35,645 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-17 21:08:35,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:35,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867063417] [2021-12-17 21:08:35,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867063417] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:35,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:08:35,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:08:35,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423277014] [2021-12-17 21:08:35,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:35,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:08:35,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:35,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:08:35,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:08:35,649 INFO L87 Difference]: Start difference. First operand 1717 states and 1893 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-17 21:08:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:36,342 INFO L93 Difference]: Finished difference Result 1953 states and 2147 transitions. [2021-12-17 21:08:36,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 21:08:36,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 202 [2021-12-17 21:08:36,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:36,343 INFO L225 Difference]: With dead ends: 1953 [2021-12-17 21:08:36,343 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 21:08:36,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-12-17 21:08:36,345 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 659 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:36,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [692 Valid, 865 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 21:08:36,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 21:08:36,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 21:08:36,345 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) [2021-12-17 21:08:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 21:08:36,346 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 202 [2021-12-17 21:08:36,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:36,346 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 21:08:36,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-17 21:08:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 21:08:36,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 21:08:36,349 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-17 21:08:36,349 INFO L764 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-17 21:08:36,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-17 21:08:36,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 21:09:01,975 WARN L227 SmtUtils]: Spent 6.69s on a formula simplification. DAG size of input: 174 DAG size of output: 172 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-17 21:10:06,360 WARN L227 SmtUtils]: Spent 6.94s on a formula simplification. DAG size of input: 175 DAG size of output: 173 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-17 21:10:48,887 WARN L227 SmtUtils]: Spent 5.20s on a formula simplification. DAG size of input: 162 DAG size of output: 160 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-17 21:12:14,461 WARN L227 SmtUtils]: Spent 6.59s on a formula simplification. DAG size of input: 177 DAG size of output: 175 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-17 21:13:18,110 WARN L227 SmtUtils]: Spent 6.85s on a formula simplification. DAG size of input: 178 DAG size of output: 176 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-17 21:14:01,020 WARN L227 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 165 DAG size of output: 163 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-17 21:14:12,667 WARN L227 SmtUtils]: Spent 5.66s on a formula simplification. DAG size of input: 164 DAG size of output: 162 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-17 21:15:25,537 WARN L227 SmtUtils]: Spent 6.60s on a formula simplification. DAG size of input: 543 DAG size of output: 188 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-12-17 21:15:59,462 WARN L227 SmtUtils]: Spent 6.63s on a formula simplification. DAG size of input: 546 DAG size of output: 191 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-12-17 21:16:11,325 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 1029 1039) no Hoare annotation was computed. [2021-12-17 21:16:11,326 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 1029 1039) the Hoare annotation is: (let ((.cse22 (not (<= ~m_pc~0 0))) (.cse23 (not (< 1 ~m_pc~0))) (.cse32 (= ~m_st~0 |old(~m_st~0)|)) (.cse33 (= ~t2_st~0 |old(~t2_st~0)|))) (let ((.cse14 (+ ~local~0 1)) (.cse6 (= ~E_M~0 0)) (.cse24 (and .cse32 (= ~t1_st~0 0) .cse33)) (.cse25 (not (= |old(~t1_st~0)| 0))) (.cse26 (not (<= ~t1_pc~0 0))) (.cse28 (not (= ~t1_pc~0 ~m_pc~0))) (.cse29 (and (not (<= 1 ~t1_pc~0)) (not (< 0 ~m_pc~0)))) (.cse18 (= ~E_2~0 0)) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (<= 2 ~E_1~0))) (.cse30 (and .cse22 (or (not (<= ~t1_pc~0 1)) .cse23))) (.cse27 (not (<= ~t2_pc~0 0))) (.cse0 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse21 (= ~E_1~0 0)) (.cse1 (not (= ~p_dw_pc~0 ~q_req_up~0))) (.cse2 (and (= ~t1_st~0 |old(~t1_st~0)|) .cse32 .cse33)) (.cse31 (not (= ~token~0 ~local~0))) (.cse3 (not (= ~t2_pc~0 1))) (.cse5 (not (= ~t1_i~0 1))) (.cse19 (not (<= 2 |old(~t2_st~0)|))) (.cse7 (not (= ~t1_pc~0 1))) (.cse20 (not (<= 2 ~E_M~0))) (.cse8 (not (= ~p_dw_st~0 0))) (.cse9 (not (<= 2 ~T1_E~0))) (.cse10 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse11 (not (= 0 ~q_req_up~0))) (.cse12 (not (<= 2 ~E_2~0))) (.cse13 (not (<= 2 ~T2_E~0))) (.cse15 (not (= ~c_dr_st~0 0))) (.cse17 (not (<= 2 |old(~t1_st~0)|)))) (and (or .cse0 (not (<= ~token~0 (+ ~local~0 2))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (< .cse14 ~token~0)) .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 (not (<= .cse14 ~token~0)) (not (<= ~token~0 .cse14)) .cse18 .cse3 .cse4 .cse5 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16) (or .cse0 .cse21 .cse1 .cse2 .cse18 .cse4 .cse6 (= ~T1_E~0 0) .cse8 (and .cse22 .cse23) .cse10 .cse11 .cse15) (or .cse0 .cse21 .cse24 .cse25 .cse1 .cse26 .cse27 .cse5 .cse28 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (or .cse0 .cse21 .cse24 .cse25 .cse1 .cse26 .cse3 .cse5 .cse19 .cse28 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (or .cse0 .cse21 .cse29 .cse1 .cse2 .cse30 .cse27 .cse5 .cse19 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (or .cse0 .cse29 .cse1 .cse2 .cse30 .cse18 (not (= 0 |old(~m_st~0)|)) .cse27 .cse5 .cse19 .cse20 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse18 .cse4 .cse27 .cse5 .cse20 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16) (or .cse0 .cse21 .cse1 .cse2 .cse30 .cse31 .cse27 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17) (or .cse0 .cse21 .cse1 .cse2 .cse31 .cse3 .cse5 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17)))) [2021-12-17 21:16:11,326 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 1029 1039) no Hoare annotation was computed. [2021-12-17 21:16:11,326 INFO L858 garLoopResultBuilder]: For program point update_channels1EXIT(lines 262 276) no Hoare annotation was computed. [2021-12-17 21:16:11,327 INFO L854 garLoopResultBuilder]: At program point L57(lines 40 59) the Hoare annotation is: (let ((.cse5 (not (<= ~c_dr_pc~0 0))) (.cse6 (not (<= ~t1_pc~0 0))) (.cse0 (not (= ~c_dr_i~0 1))) (.cse8 (not (<= ~t2_pc~0 0))) (.cse1 (not (= ~t1_pc~0 ~m_pc~0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse10 (not (= 0 ~m_st~0))) (.cse11 (not (= ~t1_st~0 0))) (.cse12 (not (<= 2 ~T1_E~0))) (.cse13 (not (<= 2 ~E_2~0))) (.cse14 (not (<= 2 ~T2_E~0))) (.cse3 (not (= 2 ~M_E~0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse15 (not (<= 2 ~E_1~0))) (.cse2 (not (= 0 |old(~q_req_up~0)|))) (.cse16 (not (= ~c_dr_pc~0 1))) (.cse7 (= 0 ~q_req_up~0))) (and (or (= ~E_1~0 0) (not (= ~c_dr_pc~0 |old(~q_req_up~0)|)) (= 1 ~p_dw_pc~0) (= ~E_2~0 0) .cse0 (not (= 2 |old(~q_read_ev~0)|)) (= ~E_M~0 0) (= 0 ~p_dw_st~0) .cse1 (= ~T1_E~0 0) .cse2 (and (not (<= ~m_pc~0 0)) (not (< 1 ~m_pc~0))) .cse3 .cse4) (or .cse5 .cse6 .cse0 .cse7 .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse3 .cse4 .cse15) (or .cse5 .cse6 .cse0 .cse8 .cse1 .cse9 .cse10 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse4 .cse15) (or .cse2 .cse16) (or .cse16 .cse7))) [2021-12-17 21:16:11,327 INFO L854 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 262 276) the Hoare annotation is: (let ((.cse2 (not (= ~c_dr_i~0 1))) (.cse3 (not (= ~t1_pc~0 ~m_pc~0))) (.cse4 (not (= 2 ~M_E~0))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse0 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse1 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse6 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse7 (= ~q_read_ev~0 |old(~q_read_ev~0)|))) (and (or (= ~E_1~0 0) (not (= ~c_dr_pc~0 |old(~q_req_up~0)|)) (= 1 ~p_dw_pc~0) (and .cse0 .cse1 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) (= ~E_2~0 0) .cse2 (not (= 2 |old(~q_read_ev~0)|)) (= ~E_M~0 0) (= 0 ~p_dw_st~0) .cse3 (= ~T1_E~0 0) (not (= 0 |old(~q_req_up~0)|)) (and (not (<= ~m_pc~0 0)) (not (< 1 ~m_pc~0))) .cse4 .cse5) (or (not (<= ~c_dr_pc~0 0)) (and .cse1 .cse0 .cse6 .cse7) (not (<= ~t1_pc~0 0)) .cse2 (not (<= ~t2_pc~0 0)) .cse3 (not (<= 2 ~E_M~0)) (not (= 0 ~m_st~0)) (not (= ~t1_st~0 0)) (not (<= 2 ~T1_E~0)) (not (<= 2 ~E_2~0)) (not (<= 2 ~T2_E~0)) .cse4 .cse5 (not (<= 2 ~E_1~0))) (or (not (= ~c_dr_pc~0 1)) (and .cse0 .cse1 .cse6 .cse7)))) [2021-12-17 21:16:11,327 INFO L858 garLoopResultBuilder]: For program point L49-1(lines 49 53) no Hoare annotation was computed. [2021-12-17 21:16:11,327 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 48) no Hoare annotation was computed. [2021-12-17 21:16:11,327 INFO L858 garLoopResultBuilder]: For program point L44-2(lines 43 58) no Hoare annotation was computed. [2021-12-17 21:16:11,327 INFO L858 garLoopResultBuilder]: For program point L266-1(lines 262 276) no Hoare annotation was computed. [2021-12-17 21:16:11,328 INFO L854 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 995 1028) the Hoare annotation is: (let ((.cse32 (not (<= ~m_pc~0 0))) (.cse33 (not (< 1 ~m_pc~0))) (.cse36 (= ~m_st~0 |old(~m_st~0)|)) (.cse37 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse38 (+ ~local~0 1))) (let ((.cse17 (not (<= ~token~0 (+ ~local~0 2)))) (.cse20 (not (< .cse38 ~token~0))) (.cse18 (= ~E_M~0 0)) (.cse28 (not (<= .cse38 ~token~0))) (.cse29 (not (<= ~token~0 .cse38))) (.cse3 (not (= ~t2_pc~0 1))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse23 (and .cse36 (= ~t1_st~0 0) .cse37)) (.cse24 (not (= |old(~t1_st~0)| 0))) (.cse25 (not (<= ~t1_pc~0 0))) (.cse26 (not (= ~t1_pc~0 ~m_pc~0))) (.cse34 (and (not (<= 1 ~t1_pc~0)) (not (< 0 ~m_pc~0)))) (.cse30 (= ~E_2~0 0)) (.cse21 (not (= 0 |old(~m_st~0)|))) (.cse6 (not (<= 2 |old(~t2_st~0)|))) (.cse15 (not (<= 2 ~E_1~0))) (.cse0 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse22 (= ~E_1~0 0)) (.cse1 (not (= ~p_dw_pc~0 ~q_req_up~0))) (.cse2 (and (= ~t1_st~0 |old(~t1_st~0)|) .cse36 .cse37)) (.cse35 (and .cse32 (or (not (<= ~t1_pc~0 1)) .cse33))) (.cse27 (not (= ~token~0 ~local~0))) (.cse31 (not (<= ~t2_pc~0 0))) (.cse5 (not (= ~t1_i~0 1))) (.cse19 (not (= ~t1_pc~0 1))) (.cse7 (not (<= 2 ~E_M~0))) (.cse8 (not (= ~p_dw_st~0 0))) (.cse9 (not (<= 2 ~T1_E~0))) (.cse10 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse11 (not (= 0 ~q_req_up~0))) (.cse12 (not (<= 2 ~E_2~0))) (.cse13 (not (<= 2 ~T2_E~0))) (.cse14 (not (= ~c_dr_st~0 0))) (.cse16 (not (<= 2 |old(~t1_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse19 .cse7 .cse8 .cse11 .cse12 .cse9 .cse10 .cse13 .cse20 .cse14 .cse16 .cse15) (or .cse0 .cse22 .cse23 .cse24 .cse1 .cse25 .cse3 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse23 .cse24 .cse1 .cse27 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse28 .cse29 .cse3 .cse4 .cse5 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse23 .cse24 .cse1 .cse25 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse30 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15) (or .cse0 .cse22 .cse1 .cse2 .cse27 .cse3 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse0 .cse22 .cse1 .cse2 .cse30 .cse4 .cse18 (= ~T1_E~0 0) .cse8 (and .cse32 .cse33) .cse10 .cse11 .cse14) (or .cse0 .cse1 .cse2 .cse28 .cse29 .cse30 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15) (or .cse0 .cse22 .cse23 .cse24 .cse1 .cse25 .cse31 .cse5 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse22 .cse34 .cse1 .cse2 .cse35 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse34 .cse1 .cse2 .cse35 .cse30 .cse21 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15) (or .cse0 .cse22 .cse1 .cse2 .cse35 .cse27 .cse31 .cse5 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16)))) [2021-12-17 21:16:11,329 INFO L854 garLoopResultBuilder]: At program point L795(lines 779 797) the Hoare annotation is: (let ((.cse66 (< 1 ~m_pc~0)) (.cse67 (<= ~m_pc~0 0))) (let ((.cse64 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse1 (= ~E_1~0 0)) (.cse65 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse53 (= ~T1_E~0 0)) (.cse52 (= ~E_M~0 0)) (.cse59 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse61 (= ~p_dw_st~0 0)) (.cse60 (= 0 ~q_req_up~0)) (.cse37 (= ~E_2~0 0)) (.cse58 (= ~c_dr_st~0 0)) (.cse40 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse38 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse7 (<= |activate_threads2_is_transmit2_triggered_~__retres1~6#1| 0)) (.cse41 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse9 (<= 0 |activate_threads2_is_transmit2_triggered_~__retres1~6#1|)) (.cse6 (<= 2 ~t2_st~0)) (.cse39 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse8 (<= |activate_threads2_is_transmit2_triggered_#res#1| 0)) (.cse42 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse44 (< 0 (+ |activate_threads2_~tmp___0~4#1| 1))) (.cse45 (<= |activate_threads2_~tmp___0~4#1| 0)) (.cse10 (= ~t1_st~0 0)) (.cse11 (<= 0 |activate_threads2_is_transmit2_triggered_#res#1|)) (.cse47 (<= 2 ~m_st~0)) (.cse62 (not .cse67)) (.cse63 (not .cse66)) (.cse43 (= ~m_st~0 |old(~m_st~0)|)) (.cse46 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse68 (+ ~local~0 1))) (let ((.cse33 (not (<= .cse68 ~token~0))) (.cse34 (not (<= ~token~0 .cse68))) (.cse28 (and .cse43 .cse46)) (.cse54 (and .cse62 .cse63)) (.cse32 (not (= ~t1_pc~0 ~m_pc~0))) (.cse36 (and .cse38 .cse7 .cse41 .cse9 .cse6 .cse39 .cse8 .cse42 .cse44 .cse45 .cse10 .cse11 .cse47)) (.cse30 (not (<= ~t1_pc~0 0))) (.cse49 (and (not (<= 1 ~t1_pc~0)) (not (< 0 ~m_pc~0)))) (.cse48 (and .cse40 .cse43 .cse46)) (.cse51 (= 0 ~m_st~0)) (.cse56 (not (<= ~token~0 (+ ~local~0 2)))) (.cse57 (not (< .cse68 ~token~0))) (.cse3 (and .cse7 .cse40 .cse8 .cse43 .cse44 .cse45 .cse9 .cse46 .cse11)) (.cse24 (not (= |old(~t1_st~0)| 0))) (.cse5 (not (= ~t2_pc~0 1))) (.cse25 (not (<= 2 |old(~m_st~0)|))) (.cse13 (not (<= 2 |old(~t2_st~0)|))) (.cse35 (and .cse38 .cse7 .cse41 .cse9 .cse8 .cse40 .cse39 .cse43 .cse42 .cse44 .cse45 .cse11 .cse46)) (.cse27 (and (or .cse66 .cse67) .cse64 (not .cse1) .cse65 (not .cse53) (not .cse52) .cse59 .cse61 .cse60 (not .cse37) .cse58 .cse47)) (.cse0 (not .cse65)) (.cse2 (not .cse64)) (.cse50 (and .cse62 (or (not (<= ~t1_pc~0 1)) .cse63))) (.cse4 (not (= ~token~0 ~local~0))) (.cse31 (not (= 0 |old(~m_st~0)|))) (.cse26 (not (<= ~t2_pc~0 0))) (.cse12 (not (= ~t1_i~0 1))) (.cse14 (not (= ~t1_pc~0 1))) (.cse15 (not (<= 2 ~E_M~0))) (.cse16 (not .cse61)) (.cse55 (and .cse38 .cse40 .cse39 .cse41 .cse42)) (.cse17 (not .cse60)) (.cse18 (not (<= 2 ~E_2~0))) (.cse19 (not (<= 2 ~T1_E~0))) (.cse20 (not .cse59)) (.cse21 (not (<= 2 ~T2_E~0))) (.cse22 (not .cse58)) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse29 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse24 .cse2 .cse4 .cse25 .cse26 .cse12 .cse14 .cse15 .cse27 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse29) (or .cse0 .cse24 .cse2 .cse30 .cse4 .cse5 .cse31 .cse12 .cse13 .cse32 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse29) (or .cse0 .cse2 .cse33 .cse34 .cse5 .cse25 .cse12 .cse14 .cse15 .cse35 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse29) (or .cse0 .cse36 .cse2 .cse33 .cse34 .cse37 .cse5 .cse25 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse19 .cse20 .cse21 (and .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) .cse22 .cse29) (or .cse0 .cse2 .cse37 .cse25 .cse26 .cse12 (and .cse38 .cse7 (or (and .cse10 .cse47) .cse48) .cse39 .cse8 .cse41 .cse42 .cse44 .cse45 .cse9 .cse11) .cse15 .cse27 .cse16 .cse19 .cse20 .cse17 .cse21 .cse22 .cse29) (or .cse0 .cse1 .cse24 .cse2 .cse30 .cse26 .cse12 .cse32 .cse15 (and .cse38 .cse7 .cse39 .cse8 .cse41 .cse42 .cse44 .cse45 .cse9 .cse10 .cse11) .cse16 .cse19 .cse20 .cse17 .cse18 .cse21 .cse22) (or .cse0 .cse49 .cse2 .cse50 .cse31 .cse26 .cse12 .cse13 .cse15 .cse16 .cse19 .cse20 .cse17 .cse18 .cse21 (and .cse40 .cse46) .cse22 .cse29) (or .cse0 .cse24 .cse2 .cse30 .cse4 .cse31 .cse26 .cse12 .cse32 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse29) (or .cse0 .cse1 .cse24 .cse2 .cse30 .cse26 .cse12 .cse13 .cse32 .cse15 .cse6 .cse16 .cse19 .cse20 .cse17 .cse18 .cse21 .cse22) (or .cse0 .cse24 .cse2 .cse30 .cse31 .cse26 .cse12 .cse13 .cse32 .cse15 .cse16 .cse19 .cse20 .cse17 .cse18 .cse51 .cse21 .cse22 .cse29) (or .cse0 .cse2 .cse25 .cse26 .cse12 .cse15 .cse27 .cse16 .cse40 .cse19 .cse20 .cse17 .cse18 .cse21 .cse22 .cse29 .cse23) (or .cse0 .cse1 .cse2 .cse37 .cse25 .cse52 .cse27 .cse53 .cse16 .cse54 .cse20 .cse17 .cse22) (or .cse0 .cse2 .cse5 .cse4 .cse31 .cse12 .cse13 .cse15 .cse14 .cse16 .cse54 .cse55 .cse20 .cse17 .cse18 .cse19 .cse21 .cse22 .cse29 .cse23) (or .cse0 .cse2 .cse37 .cse25 .cse26 .cse12 .cse13 .cse15 .cse27 .cse6 .cse16 .cse19 .cse20 .cse17 .cse21 .cse22 .cse29) (or .cse0 .cse56 .cse2 .cse5 .cse25 .cse12 .cse52 .cse35 .cse14 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse38 .cse7 .cse8 .cse39 .cse41 .cse51 .cse42 .cse44 .cse45 .cse9 .cse11 (<= 2 ~t1_st~0)) .cse57 .cse22 .cse23 .cse29) (or .cse0 .cse1 .cse24 .cse2 .cse30 .cse5 .cse12 .cse13 .cse32 (and .cse6 .cse38 .cse7 .cse39 .cse8 .cse41 .cse42 .cse44 .cse45 .cse10 .cse9 .cse11) .cse15 .cse16 .cse19 .cse20 .cse17 .cse18 .cse21 .cse22) (or .cse0 .cse36 .cse24 .cse2 .cse30 .cse5 .cse25 .cse12 .cse13 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse29) (or .cse0 .cse1 .cse49 .cse2 .cse3 .cse50 .cse26 .cse12 .cse13 .cse15 .cse16 .cse19 .cse20 .cse17 .cse18 .cse21 (and .cse6 .cse7 .cse8 .cse10 .cse9 .cse11) .cse22) (or .cse0 .cse2 .cse48 .cse25 .cse26 .cse12 .cse13 .cse15 .cse27 .cse16 .cse19 .cse20 .cse17 .cse18 .cse21 .cse22 .cse29) (or .cse0 .cse49 .cse2 .cse50 .cse37 (and .cse6 .cse38 .cse7 .cse39 .cse8 .cse41 (or .cse48 (and .cse51 .cse10)) .cse42 .cse44 .cse45 .cse9 .cse11) .cse31 .cse26 .cse12 .cse13 .cse15 .cse16 .cse19 .cse20 .cse17 .cse21 .cse22 .cse29) (or .cse0 .cse56 .cse2 .cse5 .cse31 .cse12 .cse13 .cse35 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse57 .cse22 .cse23 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse50 .cse4 (and .cse7 .cse8 .cse9 .cse10 .cse11) .cse26 .cse12 .cse14 .cse15 .cse16 .cse19 .cse20 .cse17 .cse18 .cse21 .cse22 .cse23) (or .cse0 .cse24 .cse2 .cse4 .cse5 .cse25 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 (and .cse38 .cse7 .cse41 .cse9 .cse8 .cse39 .cse43 .cse42 .cse44 .cse45 .cse10 .cse11 .cse46) .cse21 .cse22 .cse29) (or .cse0 .cse2 .cse5 .cse25 .cse12 .cse13 .cse15 .cse35 .cse27 .cse16 .cse19 .cse20 .cse17 .cse18 .cse21 .cse22 .cse29 .cse23) (or .cse0 .cse2 .cse50 .cse4 .cse31 .cse26 .cse12 .cse14 .cse15 .cse16 .cse55 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse29))))) [2021-12-17 21:16:11,329 INFO L858 garLoopResultBuilder]: For program point L783(lines 783 792) no Hoare annotation was computed. [2021-12-17 21:16:11,329 INFO L858 garLoopResultBuilder]: For program point L783-2(lines 783 792) no Hoare annotation was computed. [2021-12-17 21:16:11,329 INFO L858 garLoopResultBuilder]: For program point L746(lines 746 751) no Hoare annotation was computed. [2021-12-17 21:16:11,330 INFO L854 garLoopResultBuilder]: At program point L775(lines 763 777) the Hoare annotation is: (let ((.cse51 (< 1 ~m_pc~0)) (.cse52 (<= ~m_pc~0 0))) (let ((.cse28 (= ~E_1~0 0)) (.cse43 (= ~p_dw_st~0 0)) (.cse41 (= 0 ~q_req_up~0)) (.cse29 (= ~E_2~0 0)) (.cse49 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse50 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse31 (= ~T1_E~0 0)) (.cse30 (= ~E_M~0 0)) (.cse46 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse42 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse44 (not .cse52)) (.cse45 (not .cse51)) (.cse34 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse47 (= ~m_st~0 |old(~m_st~0)|)) (.cse35 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse48 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse53 (+ ~local~0 1))) (let ((.cse2 (not (<= .cse53 ~token~0))) (.cse3 (not (<= ~token~0 .cse53))) (.cse33 (not (<= ~token~0 (+ ~local~0 2)))) (.cse36 (not (< .cse53 ~token~0))) (.cse25 (not (= |old(~t1_st~0)| 0))) (.cse37 (not (<= ~t1_pc~0 0))) (.cse26 (and .cse34 .cse47 .cse35 (= ~t1_st~0 0) .cse48)) (.cse38 (not (= ~t1_pc~0 ~m_pc~0))) (.cse39 (and (not (<= 1 ~t1_pc~0)) (not (< 0 ~m_pc~0)))) (.cse21 (and .cse34 .cse35)) (.cse23 (not (= 0 |old(~m_st~0)|))) (.cse32 (and .cse44 .cse45)) (.cse4 (and (or .cse51 .cse52) (not .cse28) .cse43 .cse41 (not .cse29) .cse49 .cse50 (not .cse31) (not .cse30) .cse46 .cse47 .cse42 .cse48 (<= 2 ~m_st~0))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse10 (and .cse46 .cse34 .cse47 .cse35 .cse48)) (.cse19 (not (<= 2 ~E_1~0))) (.cse5 (not (= ~t2_pc~0 1))) (.cse27 (not (<= 2 |old(~t2_st~0)|))) (.cse0 (not .cse50)) (.cse1 (not .cse49)) (.cse40 (and .cse46 .cse47 .cse48)) (.cse20 (and .cse44 (or (not (<= ~t1_pc~0 1)) .cse45))) (.cse22 (not (= ~token~0 ~local~0))) (.cse24 (not (<= ~t2_pc~0 0))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~t1_pc~0 1))) (.cse9 (not (<= 2 ~E_M~0))) (.cse11 (not .cse43)) (.cse14 (not (<= 2 ~T1_E~0))) (.cse15 (not .cse42)) (.cse12 (not .cse41)) (.cse13 (not (<= 2 ~E_2~0))) (.cse16 (not (<= 2 ~T2_E~0))) (.cse17 (not (= ~c_dr_st~0 0))) (.cse18 (not (<= 2 |old(~t1_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse21 .cse22 .cse23 .cse24 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse25 .cse1 .cse22 .cse4 .cse5 .cse6 .cse7 .cse26 .cse27 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse27 .cse9 .cse10 .cse11 .cse14 .cse15 .cse12 .cse13 .cse16 .cse17 .cse19 .cse18) (or .cse0 .cse28 .cse1 .cse29 .cse4 .cse6 .cse30 .cse31 .cse11 .cse32 .cse15 .cse12 .cse17) (or .cse0 .cse33 .cse1 .cse4 .cse5 .cse6 (and .cse34 (= 0 ~m_st~0) .cse35 (<= 2 ~t1_st~0)) .cse7 .cse30 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse36 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19) (or .cse0 .cse28 .cse25 .cse1 .cse37 .cse5 .cse7 .cse27 .cse26 .cse38 .cse9 .cse11 .cse14 .cse15 .cse12 .cse13 .cse16 .cse17) (or .cse0 .cse33 .cse1 .cse5 .cse23 .cse7 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse36 .cse17 .cse18 .cse19) (or .cse0 .cse25 .cse1 .cse37 .cse4 .cse5 .cse6 .cse7 .cse26 .cse27 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (or .cse0 .cse28 .cse25 .cse1 .cse37 .cse24 .cse7 .cse26 .cse38 .cse9 .cse11 .cse14 .cse15 .cse12 .cse13 .cse16 .cse17) (or .cse0 .cse39 .cse1 .cse20 .cse29 .cse23 .cse24 .cse7 .cse27 .cse9 .cse10 .cse11 .cse14 .cse15 .cse12 .cse16 .cse17 .cse19) (or .cse0 .cse28 .cse39 .cse1 .cse40 .cse20 .cse24 .cse7 .cse27 .cse9 .cse11 .cse14 .cse15 .cse12 .cse13 .cse16 .cse17) (or .cse0 .cse1 .cse21 .cse5 .cse22 .cse23 .cse7 .cse27 .cse9 .cse8 .cse11 .cse32 .cse15 .cse12 .cse13 .cse14 .cse16 .cse17 .cse19 .cse18) (or .cse0 .cse1 .cse29 .cse4 .cse6 .cse24 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse12 .cse16 .cse17 .cse19) (or .cse0 .cse28 .cse1 .cse40 .cse22 .cse5 .cse7 .cse27 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse28 .cse1 .cse40 .cse20 .cse22 .cse24 .cse7 .cse8 .cse9 .cse11 .cse14 .cse15 .cse12 .cse13 .cse16 .cse17 .cse18))))) [2021-12-17 21:16:11,330 INFO L858 garLoopResultBuilder]: For program point L784(lines 784 789) no Hoare annotation was computed. [2021-12-17 21:16:11,330 INFO L854 garLoopResultBuilder]: At program point L776(lines 760 778) the Hoare annotation is: (let ((.cse53 (< 1 ~m_pc~0)) (.cse54 (<= ~m_pc~0 0))) (let ((.cse46 (not .cse54)) (.cse47 (not .cse53)) (.cse20 (= ~E_1~0 0)) (.cse45 (= ~p_dw_st~0 0)) (.cse43 (= 0 ~q_req_up~0)) (.cse21 (= ~E_2~0 0)) (.cse51 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse52 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse23 (= ~T1_E~0 0)) (.cse22 (= ~E_M~0 0)) (.cse48 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse44 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse55 (+ ~local~0 1)) (.cse38 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse39 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse40 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse49 (= ~m_st~0 |old(~m_st~0)|)) (.cse41 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse50 (= ~t2_st~0 |old(~t2_st~0)|))) (let ((.cse1 (not (= |old(~t1_st~0)| 0))) (.cse25 (not (<= ~t1_pc~0 0))) (.cse36 (not (= ~t1_pc~0 ~m_pc~0))) (.cse17 (and .cse38 .cse39 .cse40 .cse49 .cse41 (= ~t1_st~0 0) .cse50)) (.cse34 (not (<= ~token~0 (+ ~local~0 2)))) (.cse35 (not (< .cse55 ~token~0))) (.cse26 (not (<= .cse55 ~token~0))) (.cse27 (not (<= ~token~0 .cse55))) (.cse4 (and (or .cse53 .cse54) (not .cse20) .cse45 .cse43 (not .cse21) .cse51 .cse52 (not .cse23) (not .cse22) .cse48 .cse49 .cse44 .cse50 (<= 2 ~m_st~0))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse28 (and .cse38 .cse48 .cse39 .cse40 .cse49 .cse41 .cse50)) (.cse30 (and (not (<= 1 ~t1_pc~0)) (not (< 0 ~m_pc~0)))) (.cse5 (not (= ~t2_pc~0 1))) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse8 (not (<= 2 |old(~t2_st~0)|))) (.cse24 (and .cse46 .cse47)) (.cse37 (and .cse38 .cse39 .cse40 .cse41)) (.cse19 (not (<= 2 ~E_1~0))) (.cse0 (not .cse52)) (.cse2 (not .cse51)) (.cse42 (and .cse48 .cse49 .cse50)) (.cse31 (and .cse46 (or (not (<= ~t1_pc~0 1)) .cse47))) (.cse3 (not (= ~token~0 ~local~0))) (.cse33 (not (<= ~t2_pc~0 0))) (.cse7 (not (= ~t1_i~0 1))) (.cse9 (not (= ~t1_pc~0 1))) (.cse10 (not (<= 2 ~E_M~0))) (.cse11 (not .cse45)) (.cse14 (not (<= 2 ~T1_E~0))) (.cse15 (not .cse44)) (.cse12 (not .cse43)) (.cse13 (not (<= 2 ~E_2~0))) (.cse16 (not (<= 2 ~T2_E~0))) (.cse18 (not (= ~c_dr_st~0 0))) (.cse29 (not (<= 2 |old(~t1_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse20 .cse2 .cse21 .cse4 .cse6 .cse22 .cse23 .cse11 .cse24 .cse15 .cse12 .cse18) (or .cse0 .cse1 .cse2 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse2 .cse26 .cse27 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse14 .cse15 .cse16 .cse18 .cse29 .cse19) (or .cse0 .cse30 .cse2 .cse31 .cse21 .cse32 .cse33 .cse7 .cse8 .cse10 .cse11 .cse14 .cse15 .cse28 .cse12 .cse16 .cse18 .cse19) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse28 .cse14 .cse15 .cse12 .cse13 .cse16 .cse18 .cse19 .cse29) (or .cse0 .cse34 .cse2 .cse5 .cse32 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse14 .cse15 .cse16 .cse35 .cse18 .cse29 .cse19) (or .cse0 .cse20 .cse1 .cse2 .cse25 .cse5 .cse7 .cse8 .cse36 .cse10 .cse11 .cse14 .cse15 .cse12 .cse13 .cse16 .cse17 .cse18) (or .cse0 .cse20 .cse1 .cse2 .cse25 .cse33 .cse7 .cse36 .cse10 .cse11 .cse14 .cse15 .cse12 .cse13 .cse16 .cse17 .cse18) (or .cse0 .cse2 .cse31 .cse3 .cse32 .cse33 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse18 .cse29 .cse19) (or .cse0 .cse2 .cse21 .cse4 .cse6 .cse33 .cse7 .cse10 .cse11 .cse14 .cse15 .cse28 .cse12 .cse16 .cse18 .cse19) (or .cse0 .cse34 .cse2 .cse4 .cse5 .cse6 .cse7 .cse22 (and .cse38 .cse39 .cse40 (= 0 ~m_st~0) .cse41 (<= 2 ~t1_st~0)) .cse9 .cse11 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse35 .cse18 .cse29 .cse19) (or .cse0 .cse2 .cse26 .cse27 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse28 .cse16 .cse18 .cse19) (or .cse0 .cse20 .cse30 .cse2 .cse42 .cse31 .cse33 .cse7 .cse8 .cse10 .cse11 .cse14 .cse15 .cse12 .cse13 .cse16 .cse18) (or .cse0 .cse20 .cse2 .cse42 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse29) (or .cse0 .cse2 .cse5 .cse3 .cse32 .cse7 .cse8 .cse10 .cse9 .cse11 .cse24 .cse15 .cse12 .cse13 .cse14 .cse16 .cse37 .cse18 .cse19 .cse29) (or .cse0 .cse20 .cse2 .cse42 .cse31 .cse3 .cse33 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse12 .cse13 .cse16 .cse18 .cse29))))) [2021-12-17 21:16:11,330 INFO L858 garLoopResultBuilder]: For program point L764(lines 764 773) no Hoare annotation was computed. [2021-12-17 21:16:11,331 INFO L858 garLoopResultBuilder]: For program point L1020(lines 1020 1024) no Hoare annotation was computed. [2021-12-17 21:16:11,331 INFO L858 garLoopResultBuilder]: For program point L764-2(lines 764 773) no Hoare annotation was computed. [2021-12-17 21:16:11,331 INFO L858 garLoopResultBuilder]: For program point L1020-2(lines 995 1028) no Hoare annotation was computed. [2021-12-17 21:16:11,331 INFO L854 garLoopResultBuilder]: At program point L756(lines 744 758) the Hoare annotation is: (let ((.cse27 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse37 (not (<= ~m_pc~0 0))) (.cse38 (not (< 1 ~m_pc~0))) (.cse39 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse40 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0)) (.cse28 (= ~m_st~0 |old(~m_st~0)|)) (.cse29 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse41 (+ ~local~0 1))) (let ((.cse26 (not (<= ~token~0 (+ ~local~0 2)))) (.cse31 (not (< .cse41 ~token~0))) (.cse21 (not (= ~token~0 ~local~0))) (.cse16 (not (<= 2 |old(~t1_st~0)|))) (.cse35 (not (<= .cse41 ~token~0))) (.cse36 (not (<= ~token~0 .cse41))) (.cse2 (not (= ~t2_pc~0 1))) (.cse22 (not (= ~t1_pc~0 1))) (.cse19 (not (= |old(~t1_st~0)| 0))) (.cse24 (not (<= ~t1_pc~0 0))) (.cse20 (and .cse39 .cse40 .cse28 (= ~t1_st~0 0) .cse29)) (.cse25 (not (= ~t1_pc~0 ~m_pc~0))) (.cse12 (not (<= 2 ~E_2~0))) (.cse32 (and (not (<= 1 ~t1_pc~0)) (not (< 0 ~m_pc~0)))) (.cse33 (and .cse37 (or (not (<= ~t1_pc~0 1)) .cse38))) (.cse34 (not (= 0 |old(~m_st~0)|))) (.cse18 (not (<= ~t2_pc~0 0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (<= 2 |old(~t2_st~0)|))) (.cse7 (not (<= 2 ~E_M~0))) (.cse9 (not (<= 2 ~T1_E~0))) (.cse13 (not (<= 2 ~T2_E~0))) (.cse15 (not (<= 2 ~E_1~0))) (.cse0 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse23 (= ~E_1~0 0)) (.cse1 (not (= ~p_dw_pc~0 ~q_req_up~0))) (.cse17 (= ~E_2~0 0)) (.cse3 (and .cse39 .cse40 .cse27 .cse28 .cse29)) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse30 (= ~E_M~0 0)) (.cse8 (not (= ~p_dw_st~0 0))) (.cse10 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse11 (not (= 0 ~q_req_up~0))) (.cse14 (not (= ~c_dr_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse17 .cse3 .cse4 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15) (or .cse0 .cse19 .cse1 .cse20 .cse21 .cse2 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse11 .cse12 .cse9 .cse10 .cse13 .cse14 .cse15) (or .cse0 .cse23 .cse19 .cse1 .cse24 .cse20 .cse2 .cse5 .cse6 .cse25 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse26 .cse1 (and .cse27 .cse28 .cse29) .cse2 .cse4 .cse5 .cse30 .cse22 .cse8 .cse11 .cse12 .cse9 .cse10 .cse13 .cse31 .cse14 .cse16 .cse15) (or .cse0 .cse23 .cse32 .cse1 .cse33 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse19 .cse1 .cse24 .cse20 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse23 .cse1 .cse21 .cse2 .cse3 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse0 .cse26 .cse1 .cse2 .cse3 .cse34 .cse5 .cse6 .cse22 .cse7 .cse8 .cse11 .cse12 .cse9 .cse10 .cse13 .cse31 .cse14 .cse16 .cse15) (or .cse0 .cse1 .cse35 .cse36 .cse2 .cse3 .cse4 .cse5 .cse22 .cse7 .cse8 .cse11 .cse12 .cse9 .cse10 .cse13 .cse14 .cse16 .cse15) (or .cse0 .cse23 .cse1 .cse33 .cse21 .cse3 .cse18 .cse5 .cse22 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse0 .cse1 .cse35 .cse36 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15) (or .cse0 .cse23 .cse19 .cse1 .cse24 .cse20 .cse18 .cse5 .cse25 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse32 .cse1 .cse33 .cse17 .cse3 .cse34 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15) (or .cse0 .cse23 .cse1 .cse17 .cse3 .cse4 .cse30 (= ~T1_E~0 0) .cse8 (and .cse37 .cse38) .cse10 .cse11 .cse14)))) [2021-12-17 21:16:11,331 INFO L858 garLoopResultBuilder]: For program point L1012(lines 1012 1016) no Hoare annotation was computed. [2021-12-17 21:16:11,332 INFO L858 garLoopResultBuilder]: For program point L1012-2(lines 1012 1016) no Hoare annotation was computed. [2021-12-17 21:16:11,332 INFO L858 garLoopResultBuilder]: For program point L1004(lines 1004 1008) no Hoare annotation was computed. [2021-12-17 21:16:11,332 INFO L858 garLoopResultBuilder]: For program point L1004-2(lines 1004 1008) no Hoare annotation was computed. [2021-12-17 21:16:11,332 INFO L858 garLoopResultBuilder]: For program point L765(lines 765 770) no Hoare annotation was computed. [2021-12-17 21:16:11,332 INFO L858 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 995 1028) no Hoare annotation was computed. [2021-12-17 21:16:11,333 INFO L854 garLoopResultBuilder]: At program point L794(lines 782 796) the Hoare annotation is: (let ((.cse64 (< 1 ~m_pc~0)) (.cse65 (<= ~m_pc~0 0))) (let ((.cse44 (<= 2 ~t2_st~0)) (.cse46 (= ~t1_st~0 0)) (.cse62 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse47 (= ~E_1~0 0)) (.cse63 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse53 (= ~T1_E~0 0)) (.cse29 (= ~E_M~0 0)) (.cse57 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse59 (= ~p_dw_st~0 0)) (.cse58 (= 0 ~q_req_up~0)) (.cse43 (= ~E_2~0 0)) (.cse56 (= ~c_dr_st~0 0)) (.cse52 (<= 2 ~m_st~0)) (.cse30 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse31 (<= |activate_threads2_is_transmit2_triggered_~__retres1~6#1| 0)) (.cse26 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse32 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse33 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse35 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse36 (< 0 (+ |activate_threads2_~tmp___0~4#1| 1))) (.cse37 (<= |activate_threads2_~tmp___0~4#1| 0)) (.cse38 (<= 0 |activate_threads2_is_transmit2_triggered_~__retres1~6#1|)) (.cse60 (not .cse65)) (.cse61 (not .cse64)) (.cse50 (= ~m_st~0 |old(~m_st~0)|)) (.cse51 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse66 (+ ~local~0 1))) (let ((.cse41 (not (<= .cse66 ~token~0))) (.cse42 (not (<= ~token~0 .cse66))) (.cse10 (and .cse50 .cse51)) (.cse34 (= 0 ~m_st~0)) (.cse24 (and (not (<= 1 ~t1_pc~0)) (not (< 0 ~m_pc~0)))) (.cse54 (and .cse60 .cse61)) (.cse27 (not (<= ~token~0 (+ ~local~0 2)))) (.cse39 (not (< .cse66 ~token~0))) (.cse28 (and .cse30 .cse31 .cse26 .cse32 .cse33 .cse50 .cse35 .cse36 .cse37 .cse38 .cse51)) (.cse45 (and .cse26 .cse50 .cse51)) (.cse48 (and .cse31 .cse26 .cse50 .cse36 .cse37 .cse38 .cse51)) (.cse23 (not (= ~t1_pc~0 ~m_pc~0))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse19 (not (<= ~t1_pc~0 0))) (.cse20 (not (= ~t2_pc~0 1))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse22 (not (<= 2 |old(~t2_st~0)|))) (.cse9 (and (or .cse64 .cse65) .cse62 (not .cse47) .cse63 (not .cse53) (not .cse29) .cse57 .cse59 .cse58 (not .cse43) .cse56 .cse52)) (.cse49 (and .cse44 .cse30 .cse31 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse46 .cse52)) (.cse0 (not .cse63)) (.cse2 (not .cse62)) (.cse25 (and .cse60 (or (not (<= ~t1_pc~0 1)) .cse61))) (.cse3 (not (= ~token~0 ~local~0))) (.cse21 (not (= 0 |old(~m_st~0)|))) (.cse5 (not (<= ~t2_pc~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~t1_pc~0 1))) (.cse8 (not (<= 2 ~E_M~0))) (.cse55 (and .cse30 .cse26 .cse32 .cse33 .cse35)) (.cse11 (not .cse59)) (.cse12 (not .cse58)) (.cse13 (not (<= 2 ~E_2~0))) (.cse14 (not (<= 2 ~T1_E~0))) (.cse15 (not .cse57)) (.cse16 (not (<= 2 ~T2_E~0))) (.cse17 (not .cse56)) (.cse40 (not (<= 2 |old(~t1_st~0)|))) (.cse18 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse3 .cse20 .cse21 .cse6 .cse22 .cse23 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse24 .cse2 .cse25 .cse21 .cse5 .cse6 .cse22 .cse8 .cse11 .cse26 .cse14 .cse15 .cse12 .cse13 .cse16 .cse17 .cse18) (or .cse0 .cse27 .cse28 .cse2 .cse20 .cse4 .cse6 .cse29 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 (<= 2 ~t1_st~0)) .cse16 .cse39 .cse17 .cse40 .cse18) (or .cse0 .cse28 .cse2 .cse41 .cse42 .cse20 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse40 .cse18) (or .cse0 .cse24 .cse2 .cse25 .cse43 (and .cse44 .cse30 .cse31 .cse32 .cse33 (or .cse45 (and .cse34 .cse46)) .cse35 .cse36 .cse37 .cse38) .cse21 .cse5 .cse6 .cse22 .cse8 .cse11 .cse14 .cse15 .cse12 .cse16 .cse17 .cse18) (or .cse0 .cse47 .cse24 .cse2 .cse25 .cse5 .cse6 .cse22 .cse8 .cse48 .cse11 .cse14 .cse15 .cse12 .cse13 (and .cse44 .cse31 .cse46 .cse38) .cse16 .cse17) (or .cse0 .cse2 .cse41 .cse42 .cse43 .cse20 .cse4 .cse6 .cse22 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse49 (and .cse30 .cse32 .cse26 .cse33 .cse35 .cse50 .cse36 .cse37 .cse51) .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse3 .cse21 .cse5 .cse6 .cse23 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse47 .cse1 .cse2 .cse19 .cse5 .cse6 .cse22 .cse23 .cse8 .cse44 .cse11 .cse14 .cse15 .cse12 .cse13 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse19 .cse21 .cse5 .cse6 .cse22 .cse23 .cse8 .cse11 .cse14 .cse15 .cse12 .cse13 .cse34 .cse16 .cse17 .cse18) (or .cse0 .cse2 .cse43 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse14 .cse15 .cse12 .cse16 (and .cse30 .cse31 (or (and .cse46 .cse52) .cse45) .cse32 .cse33 .cse35 .cse36 .cse37 .cse38) .cse17 .cse18) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse26 .cse14 .cse15 .cse12 .cse13 .cse16 .cse17 .cse18 .cse40) (or .cse0 .cse24 .cse2 .cse25 .cse21 .cse5 .cse6 .cse22 .cse8 .cse11 .cse14 .cse15 .cse12 .cse13 .cse16 .cse51 .cse17 .cse18) (or .cse0 .cse47 .cse2 .cse43 .cse4 .cse29 .cse9 .cse53 .cse11 .cse54 .cse15 .cse12 .cse17) (or .cse0 .cse2 .cse20 .cse3 .cse21 .cse6 .cse22 .cse8 .cse7 .cse11 .cse54 .cse55 .cse15 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse40) (or .cse0 .cse47 .cse2 .cse3 .cse20 .cse6 .cse22 (and .cse44 .cse31 .cse38 .cse46) .cse7 .cse8 .cse48 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse40) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse4 .cse6 .cse22 .cse7 .cse8 .cse9 .cse11 (and .cse30 .cse31 .cse32 .cse33 .cse50 .cse35 .cse36 .cse37 .cse38 .cse46 .cse51) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse2 .cse43 .cse4 .cse5 .cse6 .cse22 .cse8 .cse9 .cse44 .cse11 .cse14 .cse15 .cse12 .cse16 .cse17 .cse18) (or .cse0 .cse27 .cse28 .cse2 .cse20 .cse21 .cse6 .cse22 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse39 .cse17 .cse40 .cse18) (or .cse0 .cse28 .cse2 .cse20 .cse4 .cse6 .cse22 .cse8 .cse9 .cse11 .cse14 .cse15 .cse12 .cse13 .cse16 .cse17 .cse18 .cse40) (or .cse0 .cse47 (and .cse44 .cse30 .cse31 .cse32 .cse33 .cse35 .cse36 .cse37 .cse46 .cse38) .cse1 .cse2 .cse19 .cse20 .cse6 .cse22 .cse23 .cse8 .cse11 .cse14 .cse15 .cse12 .cse13 .cse16 .cse17) (or .cse0 .cse2 .cse45 .cse4 .cse5 .cse6 .cse22 .cse8 .cse9 .cse11 .cse14 .cse15 .cse12 .cse13 .cse16 .cse17 .cse18) (or .cse0 .cse47 (and .cse31 .cse38 .cse46) .cse2 .cse25 .cse3 .cse5 .cse6 .cse7 .cse8 .cse48 .cse11 .cse14 .cse15 .cse12 .cse13 .cse16 .cse17 .cse40) (or .cse0 .cse47 .cse1 .cse2 .cse19 .cse5 .cse6 .cse23 .cse8 .cse11 (and .cse30 .cse31 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse46) .cse14 .cse15 .cse12 .cse13 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse19 .cse20 .cse4 .cse6 .cse22 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse49 .cse17 .cse18) (or .cse0 .cse2 .cse25 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse55 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse40 .cse18))))) [2021-12-17 21:16:11,333 INFO L854 garLoopResultBuilder]: At program point L757(lines 741 759) the Hoare annotation is: (let ((.cse29 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse39 (<= 0 |activate_threads2_is_master_triggered_#res#1|)) (.cse40 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse41 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0)) (.cse30 (= ~m_st~0 |old(~m_st~0)|)) (.cse42 (<= |activate_threads2_is_master_triggered_#res#1| 0)) (.cse31 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse37 (not (<= ~m_pc~0 0))) (.cse38 (not (< 1 ~m_pc~0))) (.cse43 (+ ~local~0 1))) (let ((.cse23 (not (<= .cse43 ~token~0))) (.cse24 (not (<= ~token~0 .cse43))) (.cse34 (and (not (<= 1 ~t1_pc~0)) (not (< 0 ~m_pc~0)))) (.cse19 (= ~E_2~0 0)) (.cse32 (= ~E_M~0 0)) (.cse35 (and .cse37 (or (not (<= ~t1_pc~0 1)) .cse38))) (.cse1 (= ~E_1~0 0)) (.cse4 (not (<= ~t1_pc~0 0))) (.cse21 (not (<= ~t2_pc~0 0))) (.cse8 (not (= ~t1_pc~0 ~m_pc~0))) (.cse28 (not (<= ~token~0 (+ ~local~0 2)))) (.cse36 (not (= 0 |old(~m_st~0)|))) (.cse33 (not (< .cse43 ~token~0))) (.cse2 (not (= |old(~t1_st~0)| 0))) (.cse27 (not (= ~token~0 ~local~0))) (.cse25 (not (= ~t1_pc~0 1))) (.cse16 (and .cse39 .cse40 .cse41 .cse30 .cse42 (= ~t1_st~0 0) .cse31)) (.cse0 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse18 (and .cse39 .cse40 .cse41 .cse29 .cse30 .cse42 .cse31)) (.cse3 (not (= ~p_dw_pc~0 ~q_req_up~0))) (.cse5 (not (= ~t2_pc~0 1))) (.cse20 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (<= 2 |old(~t2_st~0)|))) (.cse9 (not (<= 2 ~E_M~0))) (.cse10 (not (= ~p_dw_st~0 0))) (.cse11 (not (<= 2 ~T1_E~0))) (.cse12 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse13 (not (= 0 ~q_req_up~0))) (.cse14 (not (<= 2 ~E_2~0))) (.cse15 (not (<= 2 ~T2_E~0))) (.cse17 (not (= ~c_dr_st~0 0))) (.cse22 (not (<= 2 ~E_1~0))) (.cse26 (not (<= 2 |old(~t1_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 .cse3 .cse19 .cse20 .cse21 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse22) (or .cse0 .cse18 .cse3 .cse23 .cse24 .cse5 .cse20 .cse6 .cse25 .cse9 .cse10 .cse13 .cse14 .cse11 .cse12 .cse15 .cse17 .cse26 .cse22) (or .cse0 .cse1 .cse18 .cse3 .cse27 .cse5 .cse6 .cse7 .cse25 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse26) (or .cse0 .cse28 .cse3 (and .cse29 .cse30 .cse31) .cse5 .cse20 .cse6 .cse32 .cse25 .cse10 .cse13 .cse14 .cse11 .cse12 .cse15 .cse33 .cse17 .cse26 .cse22) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse22) (or .cse0 .cse18 .cse34 .cse3 .cse35 .cse19 .cse36 .cse21 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse22) (or .cse0 .cse18 .cse3 .cse23 .cse24 .cse19 .cse5 .cse20 .cse6 .cse7 .cse25 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse22) (or .cse0 .cse18 .cse1 .cse34 .cse3 .cse35 .cse21 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (or .cse0 .cse1 .cse18 .cse3 .cse19 .cse20 .cse32 (= ~T1_E~0 0) .cse10 (and .cse37 .cse38) .cse12 .cse13 .cse17) (or .cse0 .cse18 .cse1 .cse3 .cse35 .cse27 .cse21 .cse6 .cse25 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse21 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 .cse28 .cse3 .cse5 .cse36 .cse6 .cse7 .cse25 .cse9 .cse10 .cse13 .cse14 .cse11 .cse12 .cse15 .cse33 .cse17 .cse26 .cse22) (or .cse0 .cse2 .cse3 .cse27 .cse5 .cse20 .cse6 .cse7 .cse25 .cse9 .cse10 .cse13 .cse14 .cse11 .cse12 .cse15 .cse16 .cse17 .cse22) (or .cse0 .cse18 .cse3 .cse5 .cse20 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse22 .cse26)))) [2021-12-17 21:16:11,333 INFO L858 garLoopResultBuilder]: For program point L745(lines 745 754) no Hoare annotation was computed. [2021-12-17 21:16:11,334 INFO L858 garLoopResultBuilder]: For program point L745-2(lines 745 754) no Hoare annotation was computed. [2021-12-17 21:16:11,334 INFO L854 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 387 411) the Hoare annotation is: (let ((.cse5 (= ~p_dw_st~0 |old(~p_dw_st~0)|))) (let ((.cse0 (not (= ~c_dr_i~0 1))) (.cse1 (not (= ~t1_pc~0 ~m_pc~0))) (.cse2 (and .cse5 (= ~c_dr_st~0 0))) (.cse3 (not (= |old(~c_dr_st~0)| 0))) (.cse4 (not (= 2 ~M_E~0)))) (and (or (= ~E_1~0 0) (= 1 ~p_dw_pc~0) (= ~E_2~0 0) .cse0 (not (= 2 ~q_read_ev~0)) (= ~E_M~0 0) .cse1 .cse2 (= ~T1_E~0 0) (and (not (<= ~m_pc~0 0)) (not (< 1 ~m_pc~0))) (not (= ~c_dr_pc~0 ~q_req_up~0)) (not (= 0 ~q_req_up~0)) (= 0 |old(~p_dw_st~0)|) .cse3 .cse4) (or (and .cse5 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) (not (<= ~t1_pc~0 0)) .cse0 (not (<= ~t2_pc~0 0)) .cse1 (not (<= 2 ~E_M~0)) .cse2 (not (= 0 ~m_st~0)) (not (= ~t1_st~0 0)) (not (<= 2 ~T1_E~0)) (not (<= 2 ~E_2~0)) (not (<= 2 ~T2_E~0)) .cse3 .cse4 (not (<= 2 ~E_1~0)))))) [2021-12-17 21:16:11,334 INFO L858 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 387 411) no Hoare annotation was computed. [2021-12-17 21:16:11,334 INFO L858 garLoopResultBuilder]: For program point L403(lines 403 407) no Hoare annotation was computed. [2021-12-17 21:16:11,334 INFO L858 garLoopResultBuilder]: For program point L401(line 401) no Hoare annotation was computed. [2021-12-17 21:16:11,334 INFO L858 garLoopResultBuilder]: For program point L403-2(lines 387 411) no Hoare annotation was computed. [2021-12-17 21:16:11,334 INFO L858 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2021-12-17 21:16:11,335 INFO L854 garLoopResultBuilder]: At program point L393(line 393) the Hoare annotation is: (let ((.cse5 (= ~p_dw_st~0 |old(~p_dw_st~0)|))) (let ((.cse0 (not (= ~c_dr_i~0 1))) (.cse1 (not (= ~t1_pc~0 ~m_pc~0))) (.cse2 (and .cse5 (= ~c_dr_st~0 0))) (.cse3 (not (= |old(~c_dr_st~0)| 0))) (.cse4 (not (= 2 ~M_E~0)))) (and (or (= ~E_1~0 0) (= 1 ~p_dw_pc~0) (= ~E_2~0 0) .cse0 (not (= 2 ~q_read_ev~0)) (= ~E_M~0 0) .cse1 .cse2 (= ~T1_E~0 0) (and (not (<= ~m_pc~0 0)) (not (< 1 ~m_pc~0))) (not (= ~c_dr_pc~0 ~q_req_up~0)) (not (= 0 ~q_req_up~0)) (= 0 |old(~p_dw_st~0)|) .cse3 .cse4) (or (and .cse5 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) (not (<= ~t1_pc~0 0)) .cse0 (not (<= ~t2_pc~0 0)) .cse1 (not (<= 2 ~E_M~0)) .cse2 (not (= 0 ~m_st~0)) (not (= ~t1_st~0 0)) (not (<= 2 ~T1_E~0)) (not (<= 2 ~E_2~0)) (not (<= 2 ~T2_E~0)) .cse3 .cse4 (not (<= 2 ~E_1~0)))))) [2021-12-17 21:16:11,335 INFO L854 garLoopResultBuilder]: At program point L395-2(lines 395 399) the Hoare annotation is: (let ((.cse19 (= ~c_dr_st~0 0)) (.cse1 (= 1 ~p_dw_pc~0)) (.cse17 (< 0 (+ activate_threads1_~tmp~1 1))) (.cse20 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse18 (<= activate_threads1_~tmp~1 0)) (.cse5 (not (= 2 ~q_read_ev~0))) (.cse0 (= ~p_dw_st~0 |old(~p_dw_st~0)|)) (.cse2 (not (<= ~c_dr_pc~0 0))) (.cse3 (not (<= ~t1_pc~0 0))) (.cse4 (not (= ~c_dr_i~0 1))) (.cse6 (not (<= ~t2_pc~0 0))) (.cse7 (not (= ~t1_pc~0 ~m_pc~0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (= 0 ~m_st~0))) (.cse10 (not (= ~t1_st~0 0))) (.cse11 (not (<= 2 ~T1_E~0))) (.cse12 (not (<= 2 ~E_2~0))) (.cse13 (not (<= 2 ~T2_E~0))) (.cse14 (not (= |old(~c_dr_st~0)| 0))) (.cse15 (not (= 2 ~M_E~0))) (.cse16 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or (= ~E_1~0 0) .cse1 (and .cse0 .cse17 .cse18 .cse19) (= ~E_2~0 0) .cse4 .cse5 (= ~E_M~0 0) .cse7 (= ~T1_E~0 0) (and (not (<= ~m_pc~0 0)) (not (< 1 ~m_pc~0))) (not (= ~c_dr_pc~0 ~q_req_up~0)) (not (= 0 ~q_req_up~0)) (= 0 |old(~p_dw_st~0)|) .cse14 .cse15) (or .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse17 .cse18) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse2 (and (= ~p_dw_st~0 0) .cse19) .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and .cse0 .cse20) .cse14 .cse15 .cse16) (or .cse1 (and .cse0 .cse17 .cse20 .cse18) (not (= ~c_dr_pc~0 1)) .cse5) (or .cse0 (not (= ~p_dw_pc~0 1)) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (<= 2 ~fast_clk_edge~0)) .cse13 .cse14 .cse15 .cse16))) [2021-12-17 21:16:11,335 INFO L858 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2021-12-17 21:16:11,335 INFO L858 garLoopResultBuilder]: For program point update_channels2EXIT(lines 798 805) no Hoare annotation was computed. [2021-12-17 21:16:11,335 INFO L861 garLoopResultBuilder]: At program point update_channels2FINAL(lines 798 805) the Hoare annotation is: true [2021-12-17 21:16:11,335 INFO L858 garLoopResultBuilder]: For program point L923-1(lines 922 955) no Hoare annotation was computed. [2021-12-17 21:16:11,336 INFO L858 garLoopResultBuilder]: For program point L948-1(lines 919 956) no Hoare annotation was computed. [2021-12-17 21:16:11,336 INFO L858 garLoopResultBuilder]: For program point L938-1(lines 922 955) no Hoare annotation was computed. [2021-12-17 21:16:11,336 INFO L858 garLoopResultBuilder]: For program point L928-1(lines 922 955) no Hoare annotation was computed. [2021-12-17 21:16:11,336 INFO L854 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 919 956) the Hoare annotation is: (let ((.cse27 (not (<= ~m_pc~0 0))) (.cse28 (not (< 1 ~m_pc~0)))) (let ((.cse19 (and .cse27 (or (not (<= ~t1_pc~0 1)) .cse28))) (.cse23 (not (= ~t1_pc~0 ~m_pc~0))) (.cse21 (not (= 0 ~m_st~0))) (.cse22 (not (<= ~t1_pc~0 0))) (.cse3 (not (= ~token~0 ~local~0))) (.cse20 (not (<= ~t2_pc~0 0))) (.cse11 (not (= ~t1_st~0 0))) (.cse7 (not (<= 2 ~t2_st~0))) (.cse24 (and .cse27 .cse28)) (.cse0 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse1 (not (<= 2 |old(~T2_E~0)|))) (.cse2 (not (= ~p_dw_pc~0 ~q_req_up~0))) (.cse26 (+ ~local~0 1)) (.cse4 (not (= ~t2_pc~0 1))) (.cse5 (not (<= 2 |old(~T1_E~0)|))) (.cse6 (and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|) (= ~T2_E~0 |old(~T2_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= ~T1_E~0 |old(~T1_E~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~t1_pc~0 1))) (.cse10 (not (<= 2 ~m_st~0))) (.cse12 (not (= ~p_dw_st~0 0))) (.cse13 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse14 (not (= 0 ~q_req_up~0))) (.cse15 (not (<= 2 |old(~E_M~0)|))) (.cse25 (not (<= 2 ~t1_st~0))) (.cse16 (not (<= 2 |old(~E_1~0)|))) (.cse17 (not (= ~c_dr_st~0 0))) (.cse18 (not (<= 2 |old(~E_2~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 (and (not (<= 1 ~t1_pc~0)) (not (< 0 ~m_pc~0))) .cse2 .cse19 .cse5 .cse20 .cse6 .cse7 .cse8 .cse21 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse20 .cse5 .cse6 .cse8 .cse23 .cse21 .cse11 .cse12 .cse14 .cse13 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse7 .cse8 .cse6 .cse9 .cse21 .cse12 .cse24 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse5 .cse20 .cse7 .cse6 .cse8 .cse23 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse5 .cse20 .cse7 .cse6 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse5 .cse20 .cse8 .cse6 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse3 .cse20 .cse5 .cse6 .cse8 .cse9 .cse21 .cse12 .cse14 .cse13 .cse15 .cse25 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse8 .cse6 .cse7 .cse23 .cse21 .cse11 .cse12 .cse14 .cse13 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 (not (<= ~token~0 (+ ~local~0 2))) .cse2 .cse4 .cse5 .cse8 .cse7 .cse6 .cse9 .cse21 .cse12 .cse14 .cse13 .cse15 .cse25 (not (< .cse26 ~token~0)) .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse5 .cse20 .cse6 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse20 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18) (or .cse0 (= |old(~E_1~0)| 0) .cse2 (= |old(~T1_E~0)| 0) .cse6 (= |old(~E_M~0)| 0) .cse10 .cse12 .cse24 .cse13 .cse14 .cse17 (= |old(~E_2~0)| 0)) (or .cse0 .cse1 .cse2 (not (<= .cse26 ~token~0)) (not (<= ~token~0 .cse26)) .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18)))) [2021-12-17 21:16:11,336 INFO L858 garLoopResultBuilder]: For program point L943-1(lines 922 955) no Hoare annotation was computed. [2021-12-17 21:16:11,336 INFO L858 garLoopResultBuilder]: For program point L933-1(lines 922 955) no Hoare annotation was computed. [2021-12-17 21:16:11,337 INFO L858 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 919 956) no Hoare annotation was computed. [2021-12-17 21:16:11,337 INFO L854 garLoopResultBuilder]: At program point fire_delta_events1ENTRY(lines 315 332) the Hoare annotation is: (let ((.cse5 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse0 (and .cse5 (= ~q_read_ev~0 |old(~q_read_ev~0)|))) (.cse1 (not (= ~c_dr_i~0 1))) (.cse2 (not (= ~t1_pc~0 ~m_pc~0))) (.cse3 (not (= 2 ~M_E~0))) (.cse4 (not (= ~c_dr_st~0 0)))) (and (or (not (= ~c_dr_pc~0 1)) .cse0) (or (not (<= ~c_dr_pc~0 0)) (not (<= ~t1_pc~0 0)) .cse1 (not (<= ~t2_pc~0 0)) .cse2 (not (<= 2 ~E_M~0)) (not (= 0 ~m_st~0)) (not (= ~t1_st~0 0)) (not (<= 2 ~T1_E~0)) (not (<= 2 ~E_2~0)) (not (<= 2 ~T2_E~0)) .cse0 .cse3 .cse4 (not (<= 2 ~E_1~0))) (or (= ~E_1~0 0) (= 1 ~p_dw_pc~0) (and .cse5 (= 2 ~q_read_ev~0)) (= ~E_2~0 0) .cse1 (not (= 2 |old(~q_read_ev~0)|)) (= ~E_M~0 0) (= 0 ~p_dw_st~0) .cse2 (= ~T1_E~0 0) (and (not (<= ~m_pc~0 0)) (not (< 1 ~m_pc~0))) (not (= ~c_dr_pc~0 ~q_req_up~0)) (not (= 0 ~q_req_up~0)) .cse3 .cse4)))) [2021-12-17 21:16:11,337 INFO L858 garLoopResultBuilder]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2021-12-17 21:16:11,337 INFO L858 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 315 332) no Hoare annotation was computed. [2021-12-17 21:16:11,337 INFO L858 garLoopResultBuilder]: For program point L324-1(lines 315 332) no Hoare annotation was computed. [2021-12-17 21:16:11,337 INFO L861 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 99 127) the Hoare annotation is: true [2021-12-17 21:16:11,337 INFO L854 garLoopResultBuilder]: At program point L124(lines 102 126) the Hoare annotation is: (let ((.cse0 (not (= ~c_dr_i~0 1))) (.cse1 (not (= ~t1_pc~0 ~m_pc~0))) (.cse2 (not (= 2 ~M_E~0))) (.cse3 (and (<= 0 is_do_read_c_triggered_~__retres1~1) (<= is_do_read_c_triggered_~__retres1~1 0))) (.cse4 (not (= ~c_dr_st~0 0)))) (and (or (= ~E_1~0 0) (= 1 ~p_dw_pc~0) (= ~E_2~0 0) .cse0 (not (= 2 ~q_read_ev~0)) (= ~E_M~0 0) (= 0 ~p_dw_st~0) .cse1 (= ~T1_E~0 0) (and (not (<= ~m_pc~0 0)) (not (< 1 ~m_pc~0))) (not (= 0 ~q_req_up~0)) (not (= ~c_dr_pc~0 ~q_req_up~0)) .cse2 .cse3 .cse4) (or (not (<= ~c_dr_pc~0 0)) (not (<= ~t1_pc~0 0)) .cse0 (not (<= ~t2_pc~0 0)) .cse1 (not (<= 2 ~E_M~0)) (not (= 0 ~m_st~0)) (not (= ~t1_st~0 0)) (not (<= 2 ~T1_E~0)) (not (<= 2 ~E_2~0)) (not (<= 2 ~T2_E~0)) .cse2 .cse3 .cse4 (not (<= 2 ~E_1~0))))) [2021-12-17 21:16:11,338 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2021-12-17 21:16:11,338 INFO L858 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2021-12-17 21:16:11,338 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 99 127) no Hoare annotation was computed. [2021-12-17 21:16:11,338 INFO L858 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2021-12-17 21:16:11,338 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 99 127) no Hoare annotation was computed. [2021-12-17 21:16:11,338 INFO L858 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2021-12-17 21:16:11,338 INFO L858 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2021-12-17 21:16:11,339 INFO L854 garLoopResultBuilder]: At program point L861(line 861) the Hoare annotation is: (let ((.cse25 (< 1 ~m_pc~0)) (.cse26 (<= ~m_pc~0 0))) (let ((.cse21 (or (and .cse25 (<= ~t1_pc~0 1)) .cse26)) (.cse24 (= ~t1_pc~0 ~m_pc~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse15 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1)) (.cse20 (= 0 ~m_st~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0)) (.cse14 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse12 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse19 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse19 .cse21 .cse13 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse10 .cse11 .cse20 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse22 .cse14) (and .cse0 (<= .cse23 ~token~0) (<= ~token~0 .cse23) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11 .cse12 .cse19 .cse22 .cse14) (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse10 .cse9 .cse15 .cse11 .cse20 .cse12 .cse21 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and (or .cse25 .cse26) .cse10 (not (= ~E_1~0 0)) .cse11 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse12 .cse4 .cse7 (not (= ~E_2~0 0)) .cse8 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse20 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 (< .cse23 ~token~0) .cse20 (<= ~token~0 (+ ~local~0 2)) .cse12 .cse19 .cse22) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse12 .cse13 .cse17 .cse14)))) [2021-12-17 21:16:11,339 INFO L858 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2021-12-17 21:16:11,339 INFO L858 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2021-12-17 21:16:11,339 INFO L854 garLoopResultBuilder]: At program point L730(line 730) the Hoare annotation is: (let ((.cse4 (= ~p_dw_st~0 0)) (.cse5 (= 0 ~q_req_up~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse0 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse7 (<= 2 ~m_st~0))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse0 (not (= ~E_1~0 0)) .cse1 (not (= ~T1_E~0 0)) .cse2 .cse3 .cse4 .cse5 (not (= ~E_2~0 0)) .cse6 .cse7) (and (<= 2 ~T1_E~0) (<= 2 ~E_2~0) (= ~t1_i~0 1) .cse4 (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse5 .cse6 .cse0 (= ~t2_pc~0 1) .cse1 (< (+ ~local~0 1) ~token~0) .cse2 (<= ~token~0 (+ ~local~0 2)) .cse3 (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse7))) [2021-12-17 21:16:11,339 INFO L858 garLoopResultBuilder]: For program point L730-1(line 730) no Hoare annotation was computed. [2021-12-17 21:16:11,339 INFO L854 garLoopResultBuilder]: At program point L499-1(lines 496 536) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 (= 0 ~q_req_up~0) (not (= ~E_2~0 0)) .cse2 (not (= 1 ~p_dw_pc~0)) (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse3 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) (= ~c_dr_pc~0 1) (and (<= ~c_dr_pc~0 0) (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 (<= ~t1_pc~0 0) (= 0 ~m_st~0) .cse3 (<= ~t2_pc~0 0) (= ~t1_st~0 0)))) [2021-12-17 21:16:11,339 INFO L854 garLoopResultBuilder]: At program point L1127(line 1127) the Hoare annotation is: (let ((.cse0 (<= 2 ~T1_E~0)) (.cse1 (= ~t1_pc~0 ~m_pc~0)) (.cse2 (<= 2 ~E_2~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 2 ~M_E~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (<= 2 ~T2_E~0)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (= 0 ~q_req_up~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse11 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse12 (<= ~t1_pc~0 0)) (.cse13 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse14 (= 0 ~m_st~0)) (.cse15 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 2 ~t2_st~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse1 (not (= ~E_1~0 0)) .cse4 .cse6 .cse9 (not (= ~E_2~0 0)) .cse10 .cse11 .cse13 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse15 (<= 2 ~m_st~0)) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-12-17 21:16:11,340 INFO L854 garLoopResultBuilder]: At program point L1127-1(line 1127) the Hoare annotation is: (let ((.cse0 (<= 2 ~T1_E~0)) (.cse1 (= ~t1_pc~0 ~m_pc~0)) (.cse2 (<= 2 ~E_2~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 2 ~M_E~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (<= 2 ~T2_E~0)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (= 0 ~q_req_up~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse11 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse12 (<= ~t1_pc~0 0)) (.cse13 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse14 (= 0 ~m_st~0)) (.cse15 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 2 ~t2_st~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse1 (not (= ~E_1~0 0)) .cse4 .cse6 .cse9 (not (= ~E_2~0 0)) .cse10 .cse11 .cse13 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse15 (<= 2 ~m_st~0)) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-12-17 21:16:11,340 INFO L858 garLoopResultBuilder]: For program point L863(line 863) no Hoare annotation was computed. [2021-12-17 21:16:11,340 INFO L854 garLoopResultBuilder]: At program point L698(lines 669 704) the Hoare annotation is: (let ((.cse20 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0))) (.cse15 (= ~token~0 ~local~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse21 (= ~t2_pc~0 1)) (.cse16 (= 0 ~m_st~0)) (.cse17 (= ~t1_pc~0 1)) (.cse18 (or (and (< 1 ~m_pc~0) (<= ~t1_pc~0 1)) (<= ~m_pc~0 0))) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~t2_pc~0 0)) (.cse19 (<= 2 ~t1_st~0)) (.cse14 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse13 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse16 .cse12 .cse18 .cse13) (and (not (= ~E_1~0 0)) .cse4 .cse7 (not (= ~E_2~0 0)) .cse8 .cse20 .cse10 .cse11 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse12 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse19 .cse14) (let ((.cse22 (+ ~local~0 1))) (and .cse0 (<= .cse22 ~token~0) (<= ~token~0 .cse22) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse21 .cse11 .cse12 .cse17 .cse19 .cse14)) (and .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14))) [2021-12-17 21:16:11,340 INFO L858 garLoopResultBuilder]: For program point L632(lines 632 636) no Hoare annotation was computed. [2021-12-17 21:16:11,340 INFO L858 garLoopResultBuilder]: For program point L599(line 599) no Hoare annotation was computed. [2021-12-17 21:16:11,340 INFO L858 garLoopResultBuilder]: For program point L500(line 500) no Hoare annotation was computed. [2021-12-17 21:16:11,341 INFO L854 garLoopResultBuilder]: At program point L1128(line 1128) the Hoare annotation is: (let ((.cse0 (<= 2 ~T1_E~0)) (.cse1 (= ~t1_pc~0 ~m_pc~0)) (.cse2 (<= 2 ~E_2~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 2 ~M_E~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (<= 2 ~T2_E~0)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (= 0 ~q_req_up~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse11 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse12 (<= ~t1_pc~0 0)) (.cse13 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse14 (= 0 ~m_st~0)) (.cse15 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 2 ~t2_st~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse1 (not (= ~E_1~0 0)) .cse4 .cse6 .cse9 (not (= ~E_2~0 0)) .cse10 .cse11 .cse13 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse15 (<= 2 ~m_st~0)) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-12-17 21:16:11,341 INFO L854 garLoopResultBuilder]: At program point L1095(lines 1087 1097) the Hoare annotation is: (and (= ~token~0 ~local~0) (<= 2 ~T1_E~0) (= ~t1_pc~0 ~m_pc~0) (<= 2 ~E_2~0) (<= 2 ~E_M~0) (= 2 ~M_E~0) (= ~t1_i~0 1) (= ~p_dw_st~0 0) (<= 2 ~T2_E~0) (<= 2 ~E_1~0) (= 0 ~q_req_up~0) (= ~c_dr_st~0 0) (= ~p_dw_pc~0 ~q_req_up~0) (<= ~t1_pc~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= 0 ~m_st~0) (= ~c_dr_pc~0 ~q_req_up~0) (<= ~t2_pc~0 0) (= ~t1_st~0 0)) [2021-12-17 21:16:11,341 INFO L854 garLoopResultBuilder]: At program point L633(lines 628 667) the Hoare annotation is: (and (<= 2 ~T1_E~0) (<= 2 ~E_2~0) (<= 2 ~E_M~0) (= ~t1_i~0 1) (= ~p_dw_st~0 0) (<= 2 ~T2_E~0) (<= 2 ~E_1~0) (= 0 ~q_req_up~0) (= ~c_dr_st~0 0) (<= 2 ~t2_st~0) (= ~p_dw_pc~0 ~q_req_up~0) (= ~t2_pc~0 1) (= ~q_write_ev~0 ~q_read_ev~0) (< (+ ~local~0 1) ~token~0) (<= ~token~0 (+ ~local~0 2)) (= ~c_dr_pc~0 ~q_req_up~0) (= ~t1_pc~0 1) (<= 2 ~t1_st~0)) [2021-12-17 21:16:11,341 INFO L854 garLoopResultBuilder]: At program point L600(lines 595 602) the Hoare annotation is: false [2021-12-17 21:16:11,341 INFO L858 garLoopResultBuilder]: For program point L1063-1(lines 1052 1085) no Hoare annotation was computed. [2021-12-17 21:16:11,341 INFO L854 garLoopResultBuilder]: At program point L898(lines 860 912) the Hoare annotation is: (let ((.cse25 (< 1 ~m_pc~0)) (.cse26 (<= ~m_pc~0 0))) (let ((.cse21 (or (and .cse25 (<= ~t1_pc~0 1)) .cse26)) (.cse24 (= ~t1_pc~0 ~m_pc~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse15 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1)) (.cse20 (= 0 ~m_st~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0)) (.cse14 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse12 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse19 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse19 .cse21 .cse13 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse10 .cse11 .cse20 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse22 .cse14) (and .cse0 (<= .cse23 ~token~0) (<= ~token~0 .cse23) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11 .cse12 .cse19 .cse22 .cse14) (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse10 .cse9 .cse15 .cse11 .cse20 .cse12 .cse21 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and (or .cse25 .cse26) .cse10 (not (= ~E_1~0 0)) .cse11 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse12 .cse4 .cse7 (not (= ~E_2~0 0)) .cse8 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse20 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 (< .cse23 ~token~0) .cse20 (<= ~token~0 (+ ~local~0 2)) .cse12 .cse19 .cse22) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse12 .cse13 .cse17 .cse14)))) [2021-12-17 21:16:11,342 INFO L858 garLoopResultBuilder]: For program point L865(lines 865 869) no Hoare annotation was computed. [2021-12-17 21:16:11,342 INFO L858 garLoopResultBuilder]: For program point L865-1(lines 860 912) no Hoare annotation was computed. [2021-12-17 21:16:11,342 INFO L854 garLoopResultBuilder]: At program point L172-1(lines 156 200) the Hoare annotation is: (let ((.cse11 (not (= 1 ~p_dw_pc~0))) (.cse0 (= ~c_dr_pc~0 1)) (.cse1 (<= ~c_dr_pc~0 0)) (.cse2 (not (= 0 ~p_dw_st~0))) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ~t1_pc~0 ~m_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= 2 ~M_E~0)) (.cse8 (<= 2 ~T2_E~0)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse12 (<= ~t1_pc~0 0)) (.cse13 (= 0 ~m_st~0)) (.cse14 (= ~c_dr_i~0 1)) (.cse15 (<= ~t2_pc~0 0)) (.cse16 (= ~t1_st~0 0))) (or (and .cse0 (= ~c_dr_pc~0 ~q_req_up~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse11 .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~p_dw_pc~0 ~q_req_up~0) .cse12 .cse13 .cse14 .cse15 .cse16))) [2021-12-17 21:16:11,342 INFO L854 garLoopResultBuilder]: At program point L734(lines 705 740) the Hoare annotation is: (let ((.cse12 (<= ~t1_pc~0 0)) (.cse15 (= ~t1_st~0 0)) (.cse16 (<= 2 ~m_st~0)) (.cse17 (= ~token~0 ~local~0)) (.cse19 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse6 (<= 2 ~E_1~0)) (.cse5 (<= 2 ~T2_E~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse11 (= ~t2_pc~0 1)) (.cse13 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse20 (= 0 ~m_st~0)) (.cse14 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse18 (= ~t1_pc~0 1)) (.cse21 (<= 2 ~t1_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse18 .cse15 .cse16) (and .cse19 .cse10 (not (= ~E_1~0 0)) .cse13 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse14 .cse4 .cse7 (not (= ~E_2~0 0)) .cse8 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 (< (+ ~local~0 1) ~token~0) .cse20 (<= ~token~0 (+ ~local~0 2)) .cse14 .cse18 .cse21) (and .cse17 .cse0 (= ~t1_pc~0 ~m_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse21 .cse16) (and .cse17 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse10 .cse9 .cse11 .cse13 .cse20 .cse14 .cse18 .cse21))) [2021-12-17 21:16:11,342 INFO L858 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2021-12-17 21:16:11,342 INFO L858 garLoopResultBuilder]: For program point L1164(lines 1164 1168) no Hoare annotation was computed. [2021-12-17 21:16:11,342 INFO L861 garLoopResultBuilder]: At program point L537(lines 484 542) the Hoare annotation is: true [2021-12-17 21:16:11,343 INFO L854 garLoopResultBuilder]: At program point L471(line 471) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 (= 0 ~q_req_up~0) (not (= ~E_2~0 0)) .cse2 (not (= 1 ~p_dw_pc~0)) (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse3 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) (= ~c_dr_pc~0 1) (and (<= ~c_dr_pc~0 0) (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 (<= ~t1_pc~0 0) (= 0 ~m_st~0) .cse3 (<= ~t2_pc~0 0) (= ~t1_st~0 0)))) [2021-12-17 21:16:11,343 INFO L858 garLoopResultBuilder]: For program point L471-1(line 471) no Hoare annotation was computed. [2021-12-17 21:16:11,343 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2021-12-17 21:16:11,343 INFO L854 garLoopResultBuilder]: At program point L1132-1(lines 1129 1169) the Hoare annotation is: (let ((.cse25 (< 1 ~m_pc~0)) (.cse26 (<= ~m_pc~0 0))) (let ((.cse21 (or (and .cse25 (<= ~t1_pc~0 1)) .cse26)) (.cse24 (= ~t1_pc~0 ~m_pc~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse15 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1)) (.cse20 (= 0 ~m_st~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0)) (.cse14 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse12 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse19 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse19 .cse21 .cse13 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse10 .cse11 .cse20 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse22 .cse14) (and .cse0 (<= .cse23 ~token~0) (<= ~token~0 .cse23) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11 .cse12 .cse19 .cse22 .cse14) (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse10 .cse9 .cse15 .cse11 .cse20 .cse12 .cse21 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and (or .cse25 .cse26) .cse10 (not (= ~E_1~0 0)) .cse11 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse12 .cse4 .cse7 (not (= ~E_2~0 0)) .cse8 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse20 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 (< .cse23 ~token~0) .cse20 (<= ~token~0 (+ ~local~0 2)) .cse12 .cse19 .cse22) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse12 .cse13 .cse17 .cse14)))) [2021-12-17 21:16:11,343 INFO L858 garLoopResultBuilder]: For program point L901(lines 901 908) no Hoare annotation was computed. [2021-12-17 21:16:11,343 INFO L861 garLoopResultBuilder]: At program point L571(lines 562 573) the Hoare annotation is: true [2021-12-17 21:16:11,344 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 377) no Hoare annotation was computed. [2021-12-17 21:16:11,344 INFO L858 garLoopResultBuilder]: For program point L373-2(lines 372 385) no Hoare annotation was computed. [2021-12-17 21:16:11,344 INFO L858 garLoopResultBuilder]: For program point L1133(line 1133) no Hoare annotation was computed. [2021-12-17 21:16:11,344 INFO L858 garLoopResultBuilder]: For program point L473(lines 473 478) no Hoare annotation was computed. [2021-12-17 21:16:11,344 INFO L858 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2021-12-17 21:16:11,344 INFO L858 garLoopResultBuilder]: For program point L1068-1(lines 1052 1085) no Hoare annotation was computed. [2021-12-17 21:16:11,344 INFO L858 garLoopResultBuilder]: For program point L870(lines 860 912) no Hoare annotation was computed. [2021-12-17 21:16:11,344 INFO L854 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 (= 0 ~q_req_up~0) (not (= ~E_2~0 0)) .cse2 (not (= 1 ~p_dw_pc~0)) (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse3 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) (= ~c_dr_pc~0 1) (and (<= ~c_dr_pc~0 0) (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 (<= ~t1_pc~0 0) (= 0 ~m_st~0) .cse3 (<= ~t2_pc~0 0) (= ~t1_st~0 0)))) [2021-12-17 21:16:11,344 INFO L858 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2021-12-17 21:16:11,345 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2021-12-17 21:16:11,345 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 214) no Hoare annotation was computed. [2021-12-17 21:16:11,345 INFO L858 garLoopResultBuilder]: For program point L673(lines 673 681) no Hoare annotation was computed. [2021-12-17 21:16:11,345 INFO L854 garLoopResultBuilder]: At program point L211(lines 206 260) the Hoare annotation is: false [2021-12-17 21:16:11,345 INFO L858 garLoopResultBuilder]: For program point L641(line 641) no Hoare annotation was computed. [2021-12-17 21:16:11,345 INFO L854 garLoopResultBuilder]: At program point L443(lines 418 458) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 (= 0 ~q_req_up~0) (not (= ~E_2~0 0)) .cse2 (not (= 1 ~p_dw_pc~0)) (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse3 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) (= ~c_dr_pc~0 1) (and (<= ~c_dr_pc~0 0) (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 (<= ~t1_pc~0 0) (= 0 ~m_st~0) .cse3 (<= ~t2_pc~0 0) (= ~t1_st~0 0)))) [2021-12-17 21:16:11,345 INFO L854 garLoopResultBuilder]: At program point L179(lines 156 200) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (and (<= ~c_dr_pc~0 0) (not (= 0 ~p_dw_st~0)) (<= 2 ~T1_E~0) (= ~t1_pc~0 ~m_pc~0) (<= 2 ~E_2~0) (<= 2 ~E_M~0) (= 2 ~M_E~0) (<= 2 ~T2_E~0) (<= 2 ~E_1~0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 0) (= 0 ~m_st~0) (= ~c_dr_i~0 1) (<= ~t2_pc~0 0) (= ~t1_st~0 0))) [2021-12-17 21:16:11,346 INFO L861 garLoopResultBuilder]: At program point L1170(lines 1117 1175) the Hoare annotation is: true [2021-12-17 21:16:11,346 INFO L854 garLoopResultBuilder]: At program point L1104(line 1104) the Hoare annotation is: (let ((.cse25 (< 1 ~m_pc~0)) (.cse26 (<= ~m_pc~0 0))) (let ((.cse21 (or (and .cse25 (<= ~t1_pc~0 1)) .cse26)) (.cse24 (= ~t1_pc~0 ~m_pc~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse15 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1)) (.cse20 (= 0 ~m_st~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0)) (.cse14 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse12 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse19 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse19 .cse21 .cse13 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse10 .cse11 .cse20 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse22 .cse14) (and .cse0 (<= .cse23 ~token~0) (<= ~token~0 .cse23) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11 .cse12 .cse19 .cse22 .cse14) (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse10 .cse9 .cse15 .cse11 .cse20 .cse12 .cse21 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and (or .cse25 .cse26) .cse10 (not (= ~E_1~0 0)) .cse11 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse12 .cse4 .cse7 (not (= ~E_2~0 0)) .cse8 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse20 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 (< .cse23 ~token~0) .cse20 (<= ~token~0 (+ ~local~0 2)) .cse12 .cse19 .cse22) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse12 .cse13 .cse17 .cse14)))) [2021-12-17 21:16:11,346 INFO L858 garLoopResultBuilder]: For program point L1104-1(line 1104) no Hoare annotation was computed. [2021-12-17 21:16:11,346 INFO L858 garLoopResultBuilder]: For program point L873(lines 873 880) no Hoare annotation was computed. [2021-12-17 21:16:11,346 INFO L854 garLoopResultBuilder]: At program point L378-1(lines 369 386) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 (= 0 ~q_req_up~0) (not (= ~E_2~0 0)) .cse2 (not (= 1 ~p_dw_pc~0)) (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse3 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) (= ~c_dr_pc~0 1) (and (<= ~c_dr_pc~0 0) (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 (<= ~t1_pc~0 0) (= 0 ~m_st~0) .cse3 (<= ~t2_pc~0 0) (= ~t1_st~0 0)))) [2021-12-17 21:16:11,346 INFO L858 garLoopResultBuilder]: For program point L709(lines 709 717) no Hoare annotation was computed. [2021-12-17 21:16:11,346 INFO L858 garLoopResultBuilder]: For program point L676(lines 676 680) no Hoare annotation was computed. [2021-12-17 21:16:11,347 INFO L854 garLoopResultBuilder]: At program point L511(line 511) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 (= 0 ~q_req_up~0) (not (= ~E_2~0 0)) .cse2 (not (= 1 ~p_dw_pc~0)) (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse3 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) (= ~c_dr_pc~0 1) (and (<= ~c_dr_pc~0 0) (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 (<= ~t1_pc~0 0) (= 0 ~m_st~0) .cse3 (<= ~t2_pc~0 0) (= ~t1_st~0 0)))) [2021-12-17 21:16:11,347 INFO L854 garLoopResultBuilder]: At program point L511-1(line 511) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 (= 0 ~q_req_up~0) (not (= ~E_2~0 0)) .cse2 (not (= 1 ~p_dw_pc~0)) (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse3 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) (= ~c_dr_pc~0 1) (and (<= ~c_dr_pc~0 0) (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 (<= ~t1_pc~0 0) (= 0 ~m_st~0) .cse3 (<= ~t2_pc~0 0) (= ~t1_st~0 0)))) [2021-12-17 21:16:11,347 INFO L854 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2021-12-17 21:16:11,347 INFO L858 garLoopResultBuilder]: For program point L1106(lines 1106 1111) no Hoare annotation was computed. [2021-12-17 21:16:11,347 INFO L858 garLoopResultBuilder]: For program point L1073-1(lines 1052 1085) no Hoare annotation was computed. [2021-12-17 21:16:11,347 INFO L854 garLoopResultBuilder]: At program point L677(lines 672 703) the Hoare annotation is: (let ((.cse9 (<= 2 ~t2_st~0)) (.cse14 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0))) (.cse15 (or (and (< 1 ~m_pc~0) (<= ~t1_pc~0 1)) (<= ~m_pc~0 0))) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse13 (<= 2 ~m_st~0))) (or (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~t2_pc~0 1) .cse11 .cse12 (= ~t1_pc~0 1) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 (= 0 ~m_st~0) .cse12 .cse15 .cse16) (and (not (= ~E_1~0 0)) .cse4 .cse7 (not (= ~E_2~0 0)) .cse8 .cse14 .cse10 .cse11 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse12 .cse15 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse16 .cse13))) [2021-12-17 21:16:11,348 INFO L854 garLoopResultBuilder]: At program point L512(line 512) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 (= 0 ~q_req_up~0) (not (= ~E_2~0 0)) .cse2 (not (= 1 ~p_dw_pc~0)) (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse3 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) (= ~c_dr_pc~0 1) (and (<= ~c_dr_pc~0 0) (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 (<= ~t1_pc~0 0) (= 0 ~m_st~0) .cse3 (<= ~t2_pc~0 0) (= ~t1_st~0 0)))) [2021-12-17 21:16:11,348 INFO L858 garLoopResultBuilder]: For program point L281(lines 281 285) no Hoare annotation was computed. [2021-12-17 21:16:11,348 INFO L858 garLoopResultBuilder]: For program point L281-2(lines 280 293) no Hoare annotation was computed. [2021-12-17 21:16:11,348 INFO L854 garLoopResultBuilder]: At program point L1140(line 1140) the Hoare annotation is: (let ((.cse25 (< 1 ~m_pc~0)) (.cse26 (<= ~m_pc~0 0))) (let ((.cse21 (or (and .cse25 (<= ~t1_pc~0 1)) .cse26)) (.cse24 (= ~t1_pc~0 ~m_pc~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse15 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1)) (.cse20 (= 0 ~m_st~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0)) (.cse14 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse12 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse19 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse19 .cse21 .cse13 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse10 .cse11 .cse20 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse22 .cse14) (and .cse0 (<= .cse23 ~token~0) (<= ~token~0 .cse23) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11 .cse12 .cse19 .cse22 .cse14) (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse10 .cse9 .cse15 .cse11 .cse20 .cse12 .cse21 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and (or .cse25 .cse26) .cse10 (not (= ~E_1~0 0)) .cse11 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse12 .cse4 .cse7 (not (= ~E_2~0 0)) .cse8 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse20 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 (< .cse23 ~token~0) .cse20 (<= ~token~0 (+ ~local~0 2)) .cse12 .cse19 .cse22) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse12 .cse13 .cse17 .cse14)))) [2021-12-17 21:16:11,348 INFO L858 garLoopResultBuilder]: For program point L1140-1(line 1140) no Hoare annotation was computed. [2021-12-17 21:16:11,348 INFO L858 garLoopResultBuilder]: For program point L810(lines 810 814) no Hoare annotation was computed. [2021-12-17 21:16:11,349 INFO L858 garLoopResultBuilder]: For program point L810-2(lines 809 827) no Hoare annotation was computed. [2021-12-17 21:16:11,349 INFO L854 garLoopResultBuilder]: At program point L513(line 513) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 (= 0 ~q_req_up~0) (not (= ~E_2~0 0)) .cse2 (not (= 1 ~p_dw_pc~0)) (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse3 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) (= ~c_dr_pc~0 1) (and (<= ~c_dr_pc~0 0) (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 (<= ~t1_pc~0 0) (= 0 ~m_st~0) .cse3 (<= ~t2_pc~0 0) (= ~t1_st~0 0)))) [2021-12-17 21:16:11,349 INFO L854 garLoopResultBuilder]: At program point L480(lines 469 482) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 (= 0 ~q_req_up~0) (not (= ~E_2~0 0)) .cse2 (not (= 1 ~p_dw_pc~0)) (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse3 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) (= ~c_dr_pc~0 1) (and (<= ~c_dr_pc~0 0) (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 (<= ~t1_pc~0 0) (= 0 ~m_st~0) .cse3 (<= ~t2_pc~0 0) (= ~t1_st~0 0)))) [2021-12-17 21:16:11,349 INFO L858 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2021-12-17 21:16:11,349 INFO L858 garLoopResultBuilder]: For program point L712(lines 712 716) no Hoare annotation was computed. [2021-12-17 21:16:11,349 INFO L854 garLoopResultBuilder]: At program point L646(line 646) the Hoare annotation is: (let ((.cse16 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse20 (<= 2 ~t1_st~0)) (.cse1 (= ~t1_pc~0 ~m_pc~0)) (.cse18 (= ~t2_pc~0 1)) (.cse11 (<= ~t1_pc~0 0)) (.cse15 (= ~t1_st~0 0)) (.cse0 (<= 2 ~T1_E~0)) (.cse2 (not (= ~E_1~0 0))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (<= 2 ~T2_E~0)) (.cse8 (= 0 ~q_req_up~0)) (.cse9 (= ~c_dr_st~0 0)) (.cse17 (<= 2 ~t2_st~0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse12 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse13 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse21 (or (and (< 1 ~m_pc~0) (<= ~t1_pc~0 1)) (<= ~m_pc~0 0))) (.cse14 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse12 .cse13 .cse19 .cse20) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse19 .cse21 .cse14 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse17 .cse10 .cse12 .cse13 .cse21 .cse14))) [2021-12-17 21:16:11,349 INFO L858 garLoopResultBuilder]: For program point L646-1(line 646) no Hoare annotation was computed. [2021-12-17 21:16:11,350 INFO L854 garLoopResultBuilder]: At program point L481(lines 465 483) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 (= 0 ~q_req_up~0) (not (= ~E_2~0 0)) .cse2 (not (= 1 ~p_dw_pc~0)) (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse3 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) (= ~c_dr_pc~0 1) (and (<= ~c_dr_pc~0 0) (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 (<= ~t1_pc~0 0) (= 0 ~m_st~0) .cse3 (<= ~t2_pc~0 0) (= ~t1_st~0 0)))) [2021-12-17 21:16:11,350 INFO L854 garLoopResultBuilder]: At program point L713(lines 708 739) the Hoare annotation is: (let ((.cse3 (= ~p_dw_st~0 0)) (.cse4 (= 0 ~q_req_up~0)) (.cse5 (= ~c_dr_st~0 0)) (.cse0 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (<= 2 ~m_st~0))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse0 (not (= ~E_1~0 0)) .cse1 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse2 .cse3 .cse4 (not (= ~E_2~0 0)) .cse5 .cse6) (let ((.cse7 (+ ~local~0 1))) (and (<= 2 ~T1_E~0) (<= .cse7 ~token~0) (<= ~token~0 .cse7) (<= 2 ~E_2~0) (<= 2 ~E_M~0) (= ~t1_i~0 1) .cse3 (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse4 .cse5 .cse0 (= ~t2_pc~0 1) .cse1 .cse2 (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse6)))) [2021-12-17 21:16:11,350 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 21:16:11,350 INFO L858 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2021-12-17 21:16:11,350 INFO L854 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: false [2021-12-17 21:16:11,350 INFO L858 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2021-12-17 21:16:11,350 INFO L861 garLoopResultBuilder]: At program point L252-1(lines 206 260) the Hoare annotation is: true [2021-12-17 21:16:11,351 INFO L854 garLoopResultBuilder]: At program point L1144(line 1144) the Hoare annotation is: (let ((.cse25 (< 1 ~m_pc~0)) (.cse26 (<= ~m_pc~0 0))) (let ((.cse21 (or (and .cse25 (<= ~t1_pc~0 1)) .cse26)) (.cse24 (= ~t1_pc~0 ~m_pc~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse15 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1)) (.cse20 (= 0 ~m_st~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0)) (.cse14 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse12 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse19 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse19 .cse21 .cse13 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse10 .cse11 .cse20 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse22 .cse14) (and .cse0 (<= .cse23 ~token~0) (<= ~token~0 .cse23) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11 .cse12 .cse19 .cse22 .cse14) (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse10 .cse9 .cse15 .cse11 .cse20 .cse12 .cse21 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and (or .cse25 .cse26) .cse10 (not (= ~E_1~0 0)) .cse11 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse12 .cse4 .cse7 (not (= ~E_2~0 0)) .cse8 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse20 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 (< .cse23 ~token~0) .cse20 (<= ~token~0 (+ ~local~0 2)) .cse12 .cse19 .cse22) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse12 .cse13 .cse17 .cse14)))) [2021-12-17 21:16:11,351 INFO L854 garLoopResultBuilder]: At program point L1144-1(line 1144) the Hoare annotation is: (let ((.cse25 (< 1 ~m_pc~0)) (.cse26 (<= ~m_pc~0 0))) (let ((.cse21 (or (and .cse25 (<= ~t1_pc~0 1)) .cse26)) (.cse24 (= ~t1_pc~0 ~m_pc~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse15 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1)) (.cse20 (= 0 ~m_st~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0)) (.cse14 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse12 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse19 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse19 .cse21 .cse13 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse10 .cse11 .cse20 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse22 .cse14) (and .cse0 (<= .cse23 ~token~0) (<= ~token~0 .cse23) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11 .cse12 .cse19 .cse22 .cse14) (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse10 .cse9 .cse15 .cse11 .cse20 .cse12 .cse21 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and (or .cse25 .cse26) .cse10 (not (= ~E_1~0 0)) .cse11 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse12 .cse4 .cse7 (not (= ~E_2~0 0)) .cse8 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse20 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 (< .cse23 ~token~0) .cse20 (<= ~token~0 (+ ~local~0 2)) .cse12 .cse19 .cse22) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse12 .cse13 .cse17 .cse14)))) [2021-12-17 21:16:11,351 INFO L854 garLoopResultBuilder]: At program point L1078-1(lines 1049 1086) the Hoare annotation is: (let ((.cse25 (< 1 ~m_pc~0)) (.cse26 (<= ~m_pc~0 0))) (let ((.cse21 (or (and .cse25 (<= ~t1_pc~0 1)) .cse26)) (.cse24 (= ~t1_pc~0 ~m_pc~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse15 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1)) (.cse20 (= 0 ~m_st~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0)) (.cse14 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse12 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse19 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse19 .cse21 .cse13 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse10 .cse11 .cse20 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse22 .cse14) (and .cse0 (<= .cse23 ~token~0) (<= ~token~0 .cse23) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11 .cse12 .cse19 .cse22 .cse14) (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse10 .cse9 .cse15 .cse11 .cse20 .cse12 .cse21 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and (or .cse25 .cse26) .cse10 (not (= ~E_1~0 0)) .cse11 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse12 .cse4 .cse7 (not (= ~E_2~0 0)) .cse8 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse20 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 (< .cse23 ~token~0) .cse20 (<= ~token~0 (+ ~local~0 2)) .cse12 .cse19 .cse22) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse12 .cse13 .cse17 .cse14)))) [2021-12-17 21:16:11,352 INFO L854 garLoopResultBuilder]: At program point L913(lines 854 918) the Hoare annotation is: (let ((.cse25 (< 1 ~m_pc~0)) (.cse26 (<= ~m_pc~0 0))) (let ((.cse21 (or (and .cse25 (<= ~t1_pc~0 1)) .cse26)) (.cse24 (= ~t1_pc~0 ~m_pc~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse15 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1)) (.cse20 (= 0 ~m_st~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0)) (.cse14 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse12 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse19 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse19 .cse21 .cse13 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse10 .cse11 .cse20 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse22 .cse14) (and .cse0 (<= .cse23 ~token~0) (<= ~token~0 .cse23) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11 .cse12 .cse19 .cse22 .cse14) (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse10 .cse9 .cse15 .cse11 .cse20 .cse12 .cse21 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and (or .cse25 .cse26) .cse10 (not (= ~E_1~0 0)) .cse11 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse12 .cse4 .cse7 (not (= ~E_2~0 0)) .cse8 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse20 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 (< .cse23 ~token~0) .cse20 (<= ~token~0 (+ ~local~0 2)) .cse12 .cse19 .cse22) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse12 .cse13 .cse17 .cse14)))) [2021-12-17 21:16:11,352 INFO L854 garLoopResultBuilder]: At program point L286-1(lines 277 294) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= 0 ~q_req_up~0)) (.cse3 (= ~c_dr_st~0 0)) (.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~c_dr_i~0 1)) (.cse7 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse8 (= 2 ~q_read_ev~0))) (or (and (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~fast_clk_edge~0) (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 .cse3 .cse4 (<= ~t1_pc~0 0) (<= 2 ~slow_clk_edge~0) .cse5 (= 0 ~m_st~0) .cse6 .cse7 (<= ~t2_pc~0 0) (= ~t1_st~0 0) .cse8) (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 .cse2 (not (= ~E_2~0 0)) .cse3 .cse4 .cse5 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse6 .cse7 .cse8))) [2021-12-17 21:16:11,352 INFO L854 garLoopResultBuilder]: At program point L1145(line 1145) the Hoare annotation is: (let ((.cse25 (< 1 ~m_pc~0)) (.cse26 (<= ~m_pc~0 0))) (let ((.cse21 (or (and .cse25 (<= ~t1_pc~0 1)) .cse26)) (.cse24 (= ~t1_pc~0 ~m_pc~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse15 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1)) (.cse20 (= 0 ~m_st~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0)) (.cse14 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse12 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse19 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse19 .cse21 .cse13 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse10 .cse11 .cse20 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse22 .cse14) (and .cse0 (<= .cse23 ~token~0) (<= ~token~0 .cse23) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11 .cse12 .cse19 .cse22 .cse14) (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse10 .cse9 .cse15 .cse11 .cse20 .cse12 .cse21 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and (or .cse25 .cse26) .cse10 (not (= ~E_1~0 0)) .cse11 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse12 .cse4 .cse7 (not (= ~E_2~0 0)) .cse8 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse20 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 (< .cse23 ~token~0) .cse20 (<= ~token~0 (+ ~local~0 2)) .cse12 .cse19 .cse22) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse12 .cse13 .cse17 .cse14)))) [2021-12-17 21:16:11,352 INFO L854 garLoopResultBuilder]: At program point L1046(lines 1040 1048) the Hoare annotation is: (let ((.cse25 (< 1 ~m_pc~0)) (.cse26 (<= ~m_pc~0 0))) (let ((.cse21 (or (and .cse25 (<= ~t1_pc~0 1)) .cse26)) (.cse23 (+ ~local~0 1)) (.cse22 (<= 2 ~t1_st~0)) (.cse24 (= ~t1_pc~0 ~m_pc~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse15 (= ~t2_pc~0 1)) (.cse20 (= 0 ~m_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0)) (.cse14 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse12 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse19 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse19 .cse21 .cse13 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse10 .cse11 .cse20 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse22 .cse14) (and .cse0 (<= .cse23 ~token~0) (<= ~token~0 .cse23) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11 .cse12 .cse19 .cse22 .cse14) (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse10 .cse9 .cse15 .cse11 .cse20 .cse12 .cse21 .cse19 .cse22) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and (or .cse25 .cse26) .cse10 (not (= ~E_1~0 0)) .cse11 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse12 .cse4 .cse7 (not (= ~E_2~0 0)) .cse8 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 (< .cse23 ~token~0) .cse20 (<= ~token~0 (+ ~local~0 2)) .cse12 .cse19 .cse22) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse20 .cse12 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse12 .cse13 .cse17 .cse14)))) [2021-12-17 21:16:11,352 INFO L858 garLoopResultBuilder]: For program point L815-1(lines 809 827) no Hoare annotation was computed. [2021-12-17 21:16:11,353 INFO L858 garLoopResultBuilder]: For program point L518(lines 518 527) no Hoare annotation was computed. [2021-12-17 21:16:11,353 INFO L858 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2021-12-17 21:16:11,353 INFO L854 garLoopResultBuilder]: At program point L419(line 419) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 (= 0 ~q_req_up~0) (not (= ~E_2~0 0)) .cse2 (not (= 1 ~p_dw_pc~0)) (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse3 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) (= ~c_dr_pc~0 1) (and (<= ~c_dr_pc~0 0) (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 (<= ~t1_pc~0 0) (= 0 ~m_st~0) .cse3 (<= ~t2_pc~0 0) (= ~t1_st~0 0)))) [2021-12-17 21:16:11,353 INFO L854 garLoopResultBuilder]: At program point L1146(line 1146) the Hoare annotation is: (let ((.cse25 (< 1 ~m_pc~0)) (.cse26 (<= ~m_pc~0 0))) (let ((.cse21 (or (and .cse25 (<= ~t1_pc~0 1)) .cse26)) (.cse24 (= ~t1_pc~0 ~m_pc~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse15 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1)) (.cse20 (= 0 ~m_st~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0)) (.cse14 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse12 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse19 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse19 .cse21 .cse13 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse10 .cse11 .cse20 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse22 .cse14) (and .cse0 (<= .cse23 ~token~0) (<= ~token~0 .cse23) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11 .cse12 .cse19 .cse22 .cse14) (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse10 .cse9 .cse15 .cse11 .cse20 .cse12 .cse21 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and (or .cse25 .cse26) .cse10 (not (= ~E_1~0 0)) .cse11 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse12 .cse4 .cse7 (not (= ~E_2~0 0)) .cse8 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse20 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 (< .cse23 ~token~0) .cse20 (<= ~token~0 (+ ~local~0 2)) .cse12 .cse19 .cse22) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse12 .cse13 .cse17 .cse14)))) [2021-12-17 21:16:11,353 INFO L854 garLoopResultBuilder]: At program point L1113(lines 1102 1115) the Hoare annotation is: (let ((.cse25 (< 1 ~m_pc~0)) (.cse26 (<= ~m_pc~0 0))) (let ((.cse21 (or (and .cse25 (<= ~t1_pc~0 1)) .cse26)) (.cse24 (= ~t1_pc~0 ~m_pc~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse15 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1)) (.cse20 (= 0 ~m_st~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0)) (.cse14 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse12 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse19 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse19 .cse21 .cse13 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse10 .cse11 .cse20 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse22 .cse14) (and .cse0 (<= .cse23 ~token~0) (<= ~token~0 .cse23) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11 .cse12 .cse19 .cse22 .cse14) (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse10 .cse9 .cse15 .cse11 .cse20 .cse12 .cse21 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and (or .cse25 .cse26) .cse10 (not (= ~E_1~0 0)) .cse11 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse12 .cse4 .cse7 (not (= ~E_2~0 0)) .cse8 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse20 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 (< .cse23 ~token~0) .cse20 (<= ~token~0 (+ ~local~0 2)) .cse12 .cse19 .cse22) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse12 .cse13 .cse17 .cse14)))) [2021-12-17 21:16:11,354 INFO L854 garLoopResultBuilder]: At program point L684-1(lines 672 703) the Hoare annotation is: (let ((.cse13 (<= 2 ~m_st~0)) (.cse19 (<= 2 ~t2_st~0)) (.cse20 (= ~t2_pc~0 1)) (.cse23 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse1 (<= 2 ~E_2~0)) (.cse15 (not (= ~E_1~0 0))) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= 2 ~T2_E~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse18 (not (= ~E_2~0 0))) (.cse8 (= ~c_dr_st~0 0)) (.cse9 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse10 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (not (= ~T1_E~0 0))) (.cse17 (not (= ~E_M~0 0))) (.cse22 (= 0 ~m_st~0)) (.cse11 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse12 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse9 .cse15 .cse10 .cse16 .cse17 .cse11 .cse4 .cse7 .cse18 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse19 .cse9 .cse20 .cse10 .cse16 .cse11 .cse13) (let ((.cse21 (+ ~local~0 1))) (and .cse0 (<= .cse21 ~token~0) .cse1 (<= ~token~0 .cse21) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse20 .cse10 .cse16 .cse11 (= ~t1_pc~0 1) .cse13)) (and .cse0 .cse14 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse19 .cse9 .cse10 .cse16 .cse17 .cse22 .cse11 .cse12) (and .cse23 .cse0 .cse14 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse19 .cse9 .cse20 .cse10 .cse16 .cse17 .cse22 .cse11) (and .cse23 .cse0 .cse14 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse16 .cse17 .cse22 .cse11 .cse12))) [2021-12-17 21:16:11,354 INFO L854 garLoopResultBuilder]: At program point L1114(lines 1098 1116) the Hoare annotation is: (let ((.cse25 (< 1 ~m_pc~0)) (.cse26 (<= ~m_pc~0 0))) (let ((.cse21 (or (and .cse25 (<= ~t1_pc~0 1)) .cse26)) (.cse24 (= ~t1_pc~0 ~m_pc~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse15 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1)) (.cse20 (= 0 ~m_st~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0)) (.cse14 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse12 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse19 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse19 .cse21 .cse13 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse10 .cse11 .cse20 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse22 .cse14) (and .cse0 (<= .cse23 ~token~0) (<= ~token~0 .cse23) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11 .cse12 .cse19 .cse22 .cse14) (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse10 .cse9 .cse15 .cse11 .cse20 .cse12 .cse21 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and (or .cse25 .cse26) .cse10 (not (= ~E_1~0 0)) .cse11 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse12 .cse4 .cse7 (not (= ~E_2~0 0)) .cse8 .cse14) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse20 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 (< .cse23 ~token~0) .cse20 (<= ~token~0 (+ ~local~0 2)) .cse12 .cse19 .cse22) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse12 .cse13 .cse17 .cse14)))) [2021-12-17 21:16:11,354 INFO L858 garLoopResultBuilder]: For program point L685(line 685) no Hoare annotation was computed. [2021-12-17 21:16:11,354 INFO L858 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2021-12-17 21:16:11,354 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 21:16:11,354 INFO L854 garLoopResultBuilder]: At program point L256(lines 203 261) the Hoare annotation is: (= ~c_dr_pc~0 1) [2021-12-17 21:16:11,355 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2021-12-17 21:16:11,355 INFO L858 garLoopResultBuilder]: For program point L884(lines 860 912) no Hoare annotation was computed. [2021-12-17 21:16:11,355 INFO L858 garLoopResultBuilder]: For program point L1149(line 1149) no Hoare annotation was computed. [2021-12-17 21:16:11,355 INFO L854 garLoopResultBuilder]: At program point L720-1(lines 708 739) the Hoare annotation is: (let ((.cse19 (= ~token~0 ~local~0)) (.cse21 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse11 (= 0 ~m_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (<= 2 ~t1_st~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (<= 2 ~E_1~0)) (.cse5 (<= 2 ~T2_E~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse15 (not (= ~E_2~0 0))) (.cse8 (= ~c_dr_st~0 0)) (.cse9 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse22 (<= ~t1_pc~0 0)) (.cse10 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (not (= ~T1_E~0 0))) (.cse17 (not (= ~E_M~0 0))) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse20 (= ~t1_st~0 0)) (.cse18 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~t2_pc~0 1) .cse10 (< (+ ~local~0 1) ~token~0) .cse11 (<= ~token~0 (+ ~local~0 2)) .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse10 .cse16 .cse17 .cse12 .cse18 .cse14) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse6 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse10 .cse16 .cse17 .cse12 .cse13 .cse20 .cse18) (and .cse21 .cse9 (not (= ~E_1~0 0)) .cse10 .cse16 .cse17 .cse12 .cse6 .cse7 .cse15 .cse8 .cse18) (and .cse19 .cse0 (= ~t1_pc~0 ~m_pc~0) .cse1 .cse2 .cse3 .cse6 .cse4 .cse5 .cse7 .cse8 .cse9 .cse22 .cse10 .cse11 .cse12 .cse20) (and .cse19 .cse0 .cse21 .cse1 .cse2 .cse3 .cse6 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse22 .cse10 .cse16 .cse17 .cse12 .cse20 .cse18))) [2021-12-17 21:16:11,355 INFO L854 garLoopResultBuilder]: At program point L654-1(lines 628 667) the Hoare annotation is: (let ((.cse20 (< 1 ~m_pc~0)) (.cse21 (<= ~m_pc~0 0))) (let ((.cse9 (<= 2 ~t2_st~0)) (.cse16 (= ~t2_pc~0 1)) (.cse15 (= ~t1_pc~0 ~m_pc~0)) (.cse17 (<= ~t1_pc~0 0)) (.cse18 (= ~t1_st~0 0)) (.cse19 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse22 (= ~t1_pc~0 1)) (.cse13 (or (and .cse20 (<= ~t1_pc~0 1)) .cse21)) (.cse14 (<= ~t2_pc~0 0)) (.cse23 (<= 2 ~t1_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 .cse11 .cse12 .cse18) (and .cse19 .cse0 (or .cse20 .cse21) .cse1 .cse2 .cse3 .cse6 .cse5 .cse4 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse22 .cse12 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 (< (+ ~local~0 1) ~token~0) (<= ~token~0 (+ ~local~0 2)) .cse12 .cse22 .cse23) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse17 .cse11 .cse12 .cse14 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse22 .cse13 .cse14 .cse23)))) [2021-12-17 21:16:11,355 INFO L854 garLoopResultBuilder]: At program point L522(line 522) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 (= 0 ~q_req_up~0) (not (= ~E_2~0 0)) .cse2 (not (= 1 ~p_dw_pc~0)) (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse3 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) (= ~c_dr_pc~0 1) (and (<= ~c_dr_pc~0 0) (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 (<= ~t1_pc~0 0) (= 0 ~m_st~0) .cse3 (<= ~t2_pc~0 0) (= ~t1_st~0 0)))) [2021-12-17 21:16:11,356 INFO L858 garLoopResultBuilder]: For program point L522-1(line 522) no Hoare annotation was computed. [2021-12-17 21:16:11,356 INFO L858 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2021-12-17 21:16:11,356 INFO L858 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2021-12-17 21:16:11,356 INFO L858 garLoopResultBuilder]: For program point L357(lines 357 364) no Hoare annotation was computed. [2021-12-17 21:16:11,356 INFO L854 garLoopResultBuilder]: At program point L357-2(lines 353 368) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 (= 0 ~q_req_up~0) (not (= ~E_2~0 0)) .cse2 (not (= 1 ~p_dw_pc~0)) (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse3 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) (= ~c_dr_pc~0 1) (and (<= ~c_dr_pc~0 0) (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 (<= ~t1_pc~0 0) (= 0 ~m_st~0) .cse3 (<= ~t2_pc~0 0) (= ~t1_st~0 0)))) [2021-12-17 21:16:11,356 INFO L854 garLoopResultBuilder]: At program point L820-1(lines 806 828) the Hoare annotation is: (let ((.cse0 (<= 2 ~T1_E~0)) (.cse1 (= ~t1_pc~0 ~m_pc~0)) (.cse2 (<= 2 ~E_2~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 2 ~M_E~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (<= 2 ~T2_E~0)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (= 0 ~q_req_up~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse11 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse12 (<= ~t1_pc~0 0)) (.cse13 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse14 (= 0 ~m_st~0)) (.cse15 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 2 ~t2_st~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse1 (not (= ~E_1~0 0)) .cse4 .cse6 .cse9 (not (= ~E_2~0 0)) .cse10 .cse11 .cse13 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse15 (<= 2 ~m_st~0)) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-12-17 21:16:11,356 INFO L858 garLoopResultBuilder]: For program point L721(line 721) no Hoare annotation was computed. [2021-12-17 21:16:11,356 INFO L858 garLoopResultBuilder]: For program point L226-1(lines 226 236) no Hoare annotation was computed. [2021-12-17 21:16:11,357 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2021-12-17 21:16:11,357 INFO L858 garLoopResultBuilder]: For program point L1151(lines 1151 1160) no Hoare annotation was computed. [2021-12-17 21:16:11,357 INFO L858 garLoopResultBuilder]: For program point L1151-2(lines 1151 1160) no Hoare annotation was computed. [2021-12-17 21:16:11,357 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 21:16:11,357 INFO L858 garLoopResultBuilder]: For program point L887(lines 887 894) no Hoare annotation was computed. [2021-12-17 21:16:11,357 INFO L854 garLoopResultBuilder]: At program point L161(lines 156 200) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 1))) (or (and .cse0 (= ~c_dr_pc~0 1)) (and (<= ~c_dr_pc~0 0) (not (= 0 ~p_dw_st~0)) (<= 2 ~T1_E~0) (= ~t1_pc~0 ~m_pc~0) (<= 2 ~E_2~0) (<= 2 ~E_M~0) (= 2 ~M_E~0) (<= 2 ~T2_E~0) (<= 2 ~E_1~0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 0) (= 0 ~m_st~0) .cse0 (= ~c_dr_i~0 1) (<= ~t2_pc~0 0) (= ~t1_st~0 0)))) [2021-12-17 21:16:11,357 INFO L861 garLoopResultBuilder]: At program point L1185(lines 1176 1187) the Hoare annotation is: true [2021-12-17 21:16:11,357 INFO L858 garLoopResultBuilder]: For program point L1053(lines 1053 1057) no Hoare annotation was computed. [2021-12-17 21:16:11,357 INFO L858 garLoopResultBuilder]: For program point L1053-2(lines 1052 1085) no Hoare annotation was computed. [2021-12-17 21:16:11,357 INFO L854 garLoopResultBuilder]: At program point L492(line 492) the Hoare annotation is: (and (<= 2 ~T1_E~0) (= ~t1_pc~0 ~m_pc~0) (<= 2 ~E_2~0) (<= 2 ~E_M~0) (= 2 ~M_E~0) (<= 2 ~fast_clk_edge~0) (= ~p_dw_st~0 0) (<= 2 ~T2_E~0) (<= 2 ~E_1~0) (= 0 ~q_req_up~0) (= ~c_dr_st~0 0) (= ~p_dw_pc~0 ~q_req_up~0) (<= ~t1_pc~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) (= 0 ~m_st~0) (= ~c_dr_i~0 1) (= ~c_dr_pc~0 ~q_req_up~0) (<= ~t2_pc~0 0) (= ~t1_st~0 0) (= 2 ~q_read_ev~0)) [2021-12-17 21:16:11,357 INFO L858 garLoopResultBuilder]: For program point L492-1(line 492) no Hoare annotation was computed. [2021-12-17 21:16:11,357 INFO L854 garLoopResultBuilder]: At program point L459(lines 412 464) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 (= 0 ~q_req_up~0) (not (= ~E_2~0 0)) .cse2 (not (= 1 ~p_dw_pc~0)) (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse3 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) (= ~c_dr_pc~0 1) (and (<= ~c_dr_pc~0 0) (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 (<= ~t1_pc~0 0) (= 0 ~m_st~0) .cse3 (<= ~t2_pc~0 0) (= ~t1_st~0 0)))) [2021-12-17 21:16:11,357 INFO L854 garLoopResultBuilder]: At program point L559(lines 543 561) the Hoare annotation is: (and (<= 2 ~T1_E~0) (= ~t1_pc~0 ~m_pc~0) (<= 2 ~E_2~0) (<= 2 ~E_M~0) (= 2 ~M_E~0) (<= 2 ~fast_clk_edge~0) (= ~p_dw_st~0 0) (<= 2 ~T2_E~0) (<= 2 ~E_1~0) (= 0 ~q_req_up~0) (= ~c_dr_st~0 0) (= ~p_dw_pc~0 ~q_req_up~0) (<= ~t1_pc~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) (= 0 ~m_st~0) (= ~c_dr_i~0 1) (= ~c_dr_pc~0 ~q_req_up~0) (<= ~t2_pc~0 0) (= ~t1_st~0 0) (= 2 ~q_read_ev~0)) [2021-12-17 21:16:11,357 INFO L854 garLoopResultBuilder]: At program point L196(lines 153 201) the Hoare annotation is: (let ((.cse0 (not (= 0 ~p_dw_st~0))) (.cse1 (= ~t1_pc~0 ~m_pc~0)) (.cse2 (= 2 ~M_E~0)) (.cse3 (= ~c_dr_st~0 0)) (.cse4 (= ~c_dr_i~0 1))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse0 .cse1 (not (= ~E_1~0 0)) .cse2 (= 0 ~q_req_up~0) (not (= ~E_2~0 0)) .cse3 (not (= 1 ~p_dw_pc~0)) (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse4 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) (= ~c_dr_pc~0 1) (and (<= ~c_dr_pc~0 0) .cse0 (<= 2 ~T1_E~0) .cse1 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse2 (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse3 (<= ~t1_pc~0 0) (= 0 ~m_st~0) .cse4 (<= ~t2_pc~0 0) (= ~t1_st~0 0)))) [2021-12-17 21:16:11,357 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2021-12-17 21:16:11,357 INFO L854 garLoopResultBuilder]: At program point L494(line 494) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= 0 ~q_req_up~0)) (.cse3 (= ~c_dr_st~0 0)) (.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~c_dr_i~0 1)) (.cse7 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse8 (= 2 ~q_read_ev~0))) (or (and (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~fast_clk_edge~0) (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 .cse3 .cse4 (<= ~t1_pc~0 0) (<= 2 ~slow_clk_edge~0) .cse5 (= 0 ~m_st~0) .cse6 .cse7 (<= ~t2_pc~0 0) (= ~t1_st~0 0) .cse8) (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 .cse2 (not (= ~E_2~0 0)) .cse3 .cse4 .cse5 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse6 .cse7 .cse8))) [2021-12-17 21:16:11,358 INFO L854 garLoopResultBuilder]: At program point L494-1(line 494) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= 0 ~q_req_up~0)) (.cse3 (= ~c_dr_st~0 0)) (.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse5 (= ~c_dr_i~0 1)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse7 (= 2 ~q_read_ev~0))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 .cse2 (not (= ~E_2~0 0)) .cse3 .cse4 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse5 .cse6 .cse7) (and (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~fast_clk_edge~0) (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 .cse3 .cse4 (<= ~t1_pc~0 0) (<= 2 ~slow_clk_edge~0) (= 0 ~m_st~0) .cse5 .cse6 (<= ~t2_pc~0 0) (= ~t1_st~0 0) .cse7))) [2021-12-17 21:16:11,358 INFO L858 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2021-12-17 21:16:11,358 INFO L858 garLoopResultBuilder]: For program point L1188(lines 1188 1194) no Hoare annotation was computed. [2021-12-17 21:16:11,358 INFO L854 garLoopResultBuilder]: At program point L1155(line 1155) the Hoare annotation is: (let ((.cse25 (< 1 ~m_pc~0)) (.cse26 (<= ~m_pc~0 0))) (let ((.cse21 (or (and .cse25 (<= ~t1_pc~0 1)) .cse26)) (.cse23 (+ ~local~0 1)) (.cse22 (<= 2 ~t1_st~0)) (.cse24 (= ~t1_pc~0 ~m_pc~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse15 (= ~t2_pc~0 1)) (.cse20 (= 0 ~m_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~t2_pc~0 0)) (.cse17 (= ~t1_st~0 0)) (.cse14 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse12 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse19 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse19 .cse21 .cse13 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse10 .cse11 .cse20 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse22 .cse14) (and .cse0 (<= .cse23 ~token~0) (<= ~token~0 .cse23) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11 .cse12 .cse19 .cse22 .cse14) (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse10 .cse9 .cse15 .cse11 .cse20 .cse12 .cse21 .cse19 .cse22) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse20 .cse12 .cse13 .cse17) (and (or .cse25 .cse26) .cse10 (not (= ~E_1~0 0)) .cse11 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse12 .cse4 .cse7 (not (= ~E_2~0 0)) .cse8 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 (< .cse23 ~token~0) .cse20 (<= ~token~0 (+ ~local~0 2)) .cse12 .cse19 .cse22) (and .cse18 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse20 .cse12 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse12 .cse13 .cse17 .cse14)))) [2021-12-17 21:16:11,358 INFO L858 garLoopResultBuilder]: For program point L1155-1(line 1155) no Hoare annotation was computed. [2021-12-17 21:16:11,358 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 21:16:11,358 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2021-12-17 21:16:11,358 INFO L854 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 ~m_pc~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= 0 ~q_req_up~0)) (.cse3 (= ~c_dr_st~0 0)) (.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse5 (= ~c_dr_i~0 1)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse7 (= 2 ~q_read_ev~0))) (or (and (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (not (= 0 ~p_dw_st~0)) .cse0 (not (= ~E_1~0 0)) .cse1 .cse2 (not (= ~E_2~0 0)) .cse3 .cse4 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse5 .cse6 .cse7) (and (<= 2 ~T1_E~0) .cse0 (<= 2 ~E_2~0) (<= 2 ~E_M~0) .cse1 (<= 2 ~fast_clk_edge~0) (<= 2 ~T2_E~0) (<= 2 ~E_1~0) .cse2 .cse3 .cse4 (<= ~t1_pc~0 0) (<= 2 ~slow_clk_edge~0) (= 0 ~m_st~0) .cse5 .cse6 (<= ~t2_pc~0 0) (= ~t1_st~0 0) .cse7))) [2021-12-17 21:16:11,359 INFO L854 garLoopResultBuilder]: At program point L694(line 694) the Hoare annotation is: (let ((.cse14 (<= 2 ~m_st~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse9 (not (= ~E_2~0 0))) (.cse16 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0))) (.cse10 (<= 2 ~t2_st~0)) (.cse11 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse12 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse13 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse17 (or (and (< 1 ~m_pc~0) (<= ~t1_pc~0 1)) (<= ~m_pc~0 0))) (.cse15 (<= ~t2_pc~0 0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= .cse1 ~token~0) (<= ~token~0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~t2_pc~0 1) .cse12 .cse13 (= ~t1_pc~0 1) .cse14)) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse14) (and (not (= ~E_1~0 0)) .cse4 .cse7 .cse9 .cse8 .cse16 .cse11 .cse12 (not (= ~T1_E~0 0)) (not (= ~E_M~0 0)) .cse13 .cse17 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 (= 0 ~m_st~0) .cse13 .cse17 .cse15))) [2021-12-17 21:16:11,359 INFO L858 garLoopResultBuilder]: For program point L694-1(line 694) no Hoare annotation was computed. [2021-12-17 21:16:11,359 INFO L858 garLoopResultBuilder]: For program point L1190(lines 1190 1193) no Hoare annotation was computed. [2021-12-17 21:16:11,359 INFO L858 garLoopResultBuilder]: For program point L1058-1(lines 1052 1085) no Hoare annotation was computed. [2021-12-17 21:16:11,359 INFO L854 garLoopResultBuilder]: At program point L662(lines 625 668) the Hoare annotation is: (let ((.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse9 (<= 2 ~t2_st~0)) (.cse15 (= ~t2_pc~0 1)) (.cse16 (<= ~t1_pc~0 0)) (.cse17 (= ~t1_st~0 0)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse10 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~t2_pc~0 0)) (.cse20 (<= 2 ~t1_st~0)) (.cse14 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse12 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse19 .cse17 .cse14) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse20 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14))) [2021-12-17 21:16:11,359 INFO L858 garLoopResultBuilder]: For program point L629(lines 629 637) no Hoare annotation was computed. [2021-12-17 21:16:11,359 INFO L854 garLoopResultBuilder]: At program point L1125(line 1125) the Hoare annotation is: (and (= ~token~0 ~local~0) (<= 2 ~T1_E~0) (= ~t1_pc~0 ~m_pc~0) (<= 2 ~E_2~0) (<= 2 ~E_M~0) (= 2 ~M_E~0) (= ~t1_i~0 1) (= ~p_dw_st~0 0) (<= 2 ~T2_E~0) (<= 2 ~E_1~0) (= 0 ~q_req_up~0) (= ~c_dr_st~0 0) (= ~p_dw_pc~0 ~q_req_up~0) (<= ~t1_pc~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= 0 ~m_st~0) (= ~c_dr_pc~0 ~q_req_up~0) (<= ~t2_pc~0 0) (= ~t1_st~0 0)) [2021-12-17 21:16:11,360 INFO L858 garLoopResultBuilder]: For program point L1125-1(line 1125) no Hoare annotation was computed. [2021-12-17 21:16:11,360 INFO L854 garLoopResultBuilder]: At program point L95(lines 73 97) the Hoare annotation is: (let ((.cse7 (not (<= ~c_dr_pc~0 0))) (.cse8 (not (<= ~t1_pc~0 0))) (.cse1 (not (= ~c_dr_i~0 1))) (.cse9 (not (<= ~t2_pc~0 0))) (.cse3 (not (= ~t1_pc~0 ~m_pc~0))) (.cse10 (not (<= 2 ~E_M~0))) (.cse11 (not (= 0 ~m_st~0))) (.cse12 (not (= ~t1_st~0 0))) (.cse13 (not (<= 2 ~T1_E~0))) (.cse14 (not (<= 2 ~E_2~0))) (.cse15 (not (<= 2 ~T2_E~0))) (.cse4 (not (= 2 ~M_E~0))) (.cse6 (not (= ~c_dr_st~0 0))) (.cse16 (not (<= 2 ~E_1~0))) (.cse0 (= 1 ~p_dw_pc~0)) (.cse5 (and (<= 0 is_do_write_p_triggered_~__retres1~0) (<= is_do_write_p_triggered_~__retres1~0 0))) (.cse2 (not (= 2 ~q_read_ev~0)))) (and (or (= ~E_1~0 0) .cse0 (= ~E_2~0 0) .cse1 .cse2 (= ~E_M~0 0) (= 0 ~p_dw_st~0) .cse3 (= ~T1_E~0 0) (and (not (<= ~m_pc~0 0)) (not (< 1 ~m_pc~0))) (not (= ~c_dr_pc~0 ~q_req_up~0)) (not (= 0 ~q_req_up~0)) .cse4 .cse5 .cse6) (or (not (= ~p_dw_pc~0 1)) .cse7 .cse8 .cse1 .cse9 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 (not (<= 2 ~fast_clk_edge~0)) .cse15 .cse4 .cse5 .cse6 .cse16) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse9 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse4 .cse5 .cse6 .cse16) (or .cse0 (not (= ~c_dr_pc~0 1)) .cse5 .cse2))) [2021-12-17 21:16:11,360 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2021-12-17 21:16:11,360 INFO L858 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2021-12-17 21:16:11,360 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 70 98) no Hoare annotation was computed. [2021-12-17 21:16:11,360 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 70 98) no Hoare annotation was computed. [2021-12-17 21:16:11,360 INFO L858 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2021-12-17 21:16:11,361 INFO L858 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2021-12-17 21:16:11,361 INFO L858 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2021-12-17 21:16:11,361 INFO L861 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 70 98) the Hoare annotation is: true [2021-12-17 21:16:11,361 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 295 314) no Hoare annotation was computed. [2021-12-17 21:16:11,361 INFO L861 garLoopResultBuilder]: At program point L311(lines 298 313) the Hoare annotation is: true [2021-12-17 21:16:11,361 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 295 314) the Hoare annotation is: true [2021-12-17 21:16:11,361 INFO L858 garLoopResultBuilder]: For program point L303(lines 303 308) no Hoare annotation was computed. [2021-12-17 21:16:11,361 INFO L858 garLoopResultBuilder]: For program point L299(lines 299 309) no Hoare annotation was computed. [2021-12-17 21:16:11,361 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 295 314) no Hoare annotation was computed. [2021-12-17 21:16:11,362 INFO L861 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2021-12-17 21:16:11,362 INFO L858 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2021-12-17 21:16:11,362 INFO L858 garLoopResultBuilder]: For program point error1FINAL(lines 23 30) no Hoare annotation was computed. [2021-12-17 21:16:11,362 INFO L858 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2021-12-17 21:16:11,362 INFO L858 garLoopResultBuilder]: For program point L833(lines 833 848) no Hoare annotation was computed. [2021-12-17 21:16:11,362 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 829 853) no Hoare annotation was computed. [2021-12-17 21:16:11,362 INFO L861 garLoopResultBuilder]: At program point L850(lines 832 852) the Hoare annotation is: true [2021-12-17 21:16:11,362 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 829 853) the Hoare annotation is: true [2021-12-17 21:16:11,362 INFO L858 garLoopResultBuilder]: For program point L841(lines 841 846) no Hoare annotation was computed. [2021-12-17 21:16:11,363 INFO L858 garLoopResultBuilder]: For program point L837(lines 837 847) no Hoare annotation was computed. [2021-12-17 21:16:11,363 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 829 853) no Hoare annotation was computed. [2021-12-17 21:16:11,363 INFO L858 garLoopResultBuilder]: For program point L337-1(lines 336 349) no Hoare annotation was computed. [2021-12-17 21:16:11,363 INFO L854 garLoopResultBuilder]: At program point reset_delta_events1ENTRY(lines 333 350) the Hoare annotation is: (let ((.cse5 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse0 (and .cse5 (= ~q_read_ev~0 |old(~q_read_ev~0)|))) (.cse1 (not (= ~c_dr_i~0 1))) (.cse2 (not (= ~t1_pc~0 ~m_pc~0))) (.cse3 (not (= 2 ~M_E~0))) (.cse4 (not (= ~c_dr_st~0 0)))) (and (or (not (= ~c_dr_pc~0 1)) .cse0) (or (not (<= ~c_dr_pc~0 0)) (not (<= ~t1_pc~0 0)) .cse1 (not (<= ~t2_pc~0 0)) .cse2 (not (<= 2 ~E_M~0)) (not (= 0 ~m_st~0)) (not (= ~t1_st~0 0)) (not (<= 2 ~T1_E~0)) (not (<= 2 ~E_2~0)) (not (<= 2 ~T2_E~0)) .cse0 .cse3 .cse4 (not (<= 2 ~E_1~0))) (or (= ~E_1~0 0) (= 1 ~p_dw_pc~0) (and .cse5 (= 2 ~q_read_ev~0)) (= ~E_2~0 0) .cse1 (not (= 2 |old(~q_read_ev~0)|)) (= ~E_M~0 0) (= 0 ~p_dw_st~0) .cse2 (= ~T1_E~0 0) (and (not (<= ~m_pc~0 0)) (not (< 1 ~m_pc~0))) (not (= ~c_dr_pc~0 ~q_req_up~0)) (not (= 0 ~q_req_up~0)) .cse3 .cse4)))) [2021-12-17 21:16:11,363 INFO L858 garLoopResultBuilder]: For program point L342-1(lines 333 350) no Hoare annotation was computed. [2021-12-17 21:16:11,363 INFO L858 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 333 350) no Hoare annotation was computed. [2021-12-17 21:16:11,363 INFO L858 garLoopResultBuilder]: For program point L981-1(lines 960 993) no Hoare annotation was computed. [2021-12-17 21:16:11,364 INFO L854 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 957 994) the Hoare annotation is: (let ((.cse27 (not (<= ~m_pc~0 0))) (.cse28 (not (< 1 ~m_pc~0)))) (let ((.cse19 (and .cse27 (or (not (<= ~t1_pc~0 1)) .cse28))) (.cse23 (not (= ~t1_pc~0 ~m_pc~0))) (.cse21 (not (= 0 ~m_st~0))) (.cse22 (not (<= ~t1_pc~0 0))) (.cse3 (not (= ~token~0 ~local~0))) (.cse20 (not (<= ~t2_pc~0 0))) (.cse11 (not (= ~t1_st~0 0))) (.cse7 (not (<= 2 ~t2_st~0))) (.cse24 (and .cse27 .cse28)) (.cse0 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse1 (not (<= 2 |old(~T2_E~0)|))) (.cse2 (not (= ~p_dw_pc~0 ~q_req_up~0))) (.cse26 (+ ~local~0 1)) (.cse4 (not (= ~t2_pc~0 1))) (.cse5 (not (<= 2 |old(~T1_E~0)|))) (.cse6 (and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|) (= ~T2_E~0 |old(~T2_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= ~T1_E~0 |old(~T1_E~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~t1_pc~0 1))) (.cse10 (not (<= 2 ~m_st~0))) (.cse12 (not (= ~p_dw_st~0 0))) (.cse13 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse14 (not (= 0 ~q_req_up~0))) (.cse15 (not (<= 2 |old(~E_M~0)|))) (.cse25 (not (<= 2 ~t1_st~0))) (.cse16 (not (<= 2 |old(~E_1~0)|))) (.cse17 (not (= ~c_dr_st~0 0))) (.cse18 (not (<= 2 |old(~E_2~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 (and (not (<= 1 ~t1_pc~0)) (not (< 0 ~m_pc~0))) .cse2 .cse19 .cse5 .cse20 .cse6 .cse7 .cse8 .cse21 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse20 .cse5 .cse6 .cse8 .cse23 .cse21 .cse11 .cse12 .cse14 .cse13 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse7 .cse8 .cse6 .cse9 .cse21 .cse12 .cse24 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse5 .cse20 .cse7 .cse6 .cse8 .cse23 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse5 .cse20 .cse7 .cse6 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse5 .cse20 .cse8 .cse6 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse3 .cse20 .cse5 .cse6 .cse8 .cse9 .cse21 .cse12 .cse14 .cse13 .cse15 .cse25 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse8 .cse6 .cse7 .cse23 .cse21 .cse11 .cse12 .cse14 .cse13 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 (not (<= ~token~0 (+ ~local~0 2))) .cse2 .cse4 .cse5 .cse8 .cse7 .cse6 .cse9 .cse21 .cse12 .cse14 .cse13 .cse15 .cse25 (not (< .cse26 ~token~0)) .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse5 .cse20 .cse6 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse20 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18) (or .cse0 (= |old(~E_1~0)| 0) .cse2 (= |old(~T1_E~0)| 0) .cse6 (= |old(~E_M~0)| 0) .cse10 .cse12 .cse24 .cse13 .cse14 .cse17 (= |old(~E_2~0)| 0)) (or .cse0 .cse1 .cse2 (not (<= .cse26 ~token~0)) (not (<= ~token~0 .cse26)) .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18)))) [2021-12-17 21:16:11,364 INFO L858 garLoopResultBuilder]: For program point L971-1(lines 960 993) no Hoare annotation was computed. [2021-12-17 21:16:11,364 INFO L858 garLoopResultBuilder]: For program point L961-1(lines 960 993) no Hoare annotation was computed. [2021-12-17 21:16:11,364 INFO L858 garLoopResultBuilder]: For program point L986-1(lines 957 994) no Hoare annotation was computed. [2021-12-17 21:16:11,364 INFO L858 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 957 994) no Hoare annotation was computed. [2021-12-17 21:16:11,364 INFO L858 garLoopResultBuilder]: For program point L976-1(lines 960 993) no Hoare annotation was computed. [2021-12-17 21:16:11,364 INFO L858 garLoopResultBuilder]: For program point L966-1(lines 960 993) no Hoare annotation was computed. [2021-12-17 21:16:11,367 INFO L732 BasicCegarLoop]: Path program 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] [2021-12-17 21:16:11,368 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 21:16:11,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 09:16:11 BoogieIcfgContainer [2021-12-17 21:16:11,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 21:16:11,482 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 21:16:11,482 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 21:16:11,482 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 21:16:11,483 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:07:46" (3/4) ... [2021-12-17 21:16:11,485 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-17 21:16:11,491 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-12-17 21:16:11,491 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2021-12-17 21:16:11,491 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2021-12-17 21:16:11,491 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2021-12-17 21:16:11,491 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2021-12-17 21:16:11,491 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2021-12-17 21:16:11,492 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2021-12-17 21:16:11,492 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2021-12-17 21:16:11,492 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2021-12-17 21:16:11,492 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2021-12-17 21:16:11,492 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2021-12-17 21:16:11,492 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2021-12-17 21:16:11,492 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2021-12-17 21:16:11,493 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2021-12-17 21:16:11,502 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2021-12-17 21:16:11,502 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-17 21:16:11,503 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-17 21:16:11,504 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-17 21:16:11,523 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st))) && ((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || E_2 == 0) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || ((((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0) && t2_st == \old(t2_st))) || !(token == local)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || ((((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0) && t2_st == \old(t2_st))) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || E_M == 0) || !(t1_pc == 1)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && (((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || ((((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0) && t2_st == \old(t2_st))) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(t2_pc == 1)) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || !(t2_pc == 1)) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(token == local)) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || E_2 == 0) || !(t2_pc == 1)) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || ((((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0) && t2_st == \old(t2_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && (((((((((((((((((!(q_write_ev == q_read_ev) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || E_2 == 0) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || E_2 == 0) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(2 <= \old(m_st))) || E_M == 0) || T1_E == 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(c_dr_st == 0)) [2021-12-17 21:16:11,523 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((E_1 == 0 || !(c_dr_pc == \old(q_req_up))) || 1 == p_dw_pc) || E_2 == 0) || !(c_dr_i == 1)) || !(2 == \old(q_read_ev))) || E_M == 0) || 0 == p_dw_st) || !(t1_pc == m_pc)) || T1_E == 0) || !(0 == \old(q_req_up))) || (!(m_pc <= 0) && !(1 < m_pc))) || !(2 == M_E)) || !(c_dr_st == 0)) && ((((((((((((((!(c_dr_pc <= 0) || !(t1_pc <= 0)) || !(c_dr_i == 1)) || 0 == q_req_up) || !(t2_pc <= 0)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(0 == m_st)) || !(t1_st == 0)) || !(2 <= T1_E)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(2 == M_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((!(c_dr_pc <= 0) || !(t1_pc <= 0)) || !(c_dr_i == 1)) || !(t2_pc <= 0)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(0 == m_st)) || !(t1_st == 0)) || !(0 == \old(q_req_up))) || !(2 <= T1_E)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(2 == M_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (!(0 == \old(q_req_up)) || !(c_dr_pc == 1))) && (!(c_dr_pc == 1) || 0 == q_req_up) [2021-12-17 21:16:11,523 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && \result <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0)) && ((((((((((((((!(q_write_ev == q_read_ev) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || E_2 == 0) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || E_M == 0) || !(t1_pc == 1)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && \result <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || E_2 == 0) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || E_2 == 0) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || E_1 == 0) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && ((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || E_2 == 0) || !(2 <= \old(m_st))) || E_M == 0) || T1_E == 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(c_dr_st == 0))) && (((((((((((((((((!(q_write_ev == q_read_ev) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || E_1 == 0) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(token == local)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && ((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && \result <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && \result <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st))) [2021-12-17 21:16:11,526 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((t1_st == \old(t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1)) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || (0 <= __retres1 && __retres1 <= 0)) || !(token == local)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(token == local)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || ((((0 <= __retres1 && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((t1_st == \old(t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && ((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || E_2 == 0) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(2 <= \old(m_st))) || E_M == 0) || T1_E == 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(c_dr_st == 0))) && ((((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || (((0 <= __retres1 && 0 == m_st) && __retres1 <= 0) && 2 <= t1_st)) || !(t1_i == 1)) || E_M == 0) || !(t1_pc == 1)) || ((((t1_st == \old(t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || E_2 == 0) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((t1_st == \old(t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || ((((0 <= __retres1 && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((t1_st == \old(t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || ((((0 <= __retres1 && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc <= 0)) || !(t1_i == 1)) || ((((0 <= __retres1 && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && (((((((((((((((((!(q_write_ev == q_read_ev) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || E_2 == 0) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((t1_st == \old(t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || (0 <= __retres1 && __retres1 <= 0)) || !(t2_pc == 1)) || !(token == local)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(t1_pc == 1)) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && (((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || E_2 == 0) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || ((((t1_st == \old(t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(token == local)) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(token == local)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) [2021-12-17 21:16:11,526 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(token == local)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || ((((((\result <= 0 && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0)) || !(2 <= E_1)) && ((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || E_2 == 0) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(2 <= \old(m_st))) || E_M == 0) || T1_E == 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(c_dr_st == 0))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || ((((((\result <= 0 && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || ((((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || E_2 == 0) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || ((((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || ((((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || ((((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || ((((((\result <= 0 && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0))) && ((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || ((((((\result <= 0 && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(token == local)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || (((\result <= 0 && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || E_2 == 0) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || ((((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || E_M == 0) || (((((\result <= 0 && 0 <= __retres1) && 0 <= \result) && 0 == m_st) && __retres1 <= 0) && 2 <= t1_st)) || !(t1_pc == 1)) || !(p_dw_st == 0)) || ((((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || E_2 == 0) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || ((((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(token == local)) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(token == local)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(t1_pc == 1)) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(2 <= T2_E)) || (((\result <= 0 && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(token == local)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) [2021-12-17 21:16:11,527 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || (m_st == \old(m_st) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(token == local)) || !(t2_pc == 1)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || (m_st == \old(m_st) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || t1_st == \old(t1_st)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || ((((((((((\result <= 0 && __retres1 <= 0) && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || E_M == 0) || !(t1_pc == 1)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || (((((((((\result <= 0 && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 == m_st) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && 2 <= t1_st)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || ((((((((((\result <= 0 && __retres1 <= 0) && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || E_2 == 0) || (((((((((2 <= t2_st && \result <= 0) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && (((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st)) || (0 == m_st && t1_st == 0))) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((((__retres1 <= 0 && t1_st == \old(t1_st)) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || (((2 <= t2_st && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && ((((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || E_2 == 0) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || ((((((((((2 <= t2_st && \result <= 0) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t1_st == 0) && 2 <= m_st)) || ((((((((\result <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && 0 <= \result) && __retres1 <= 0) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && tmp___0 <= 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(token == local)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || (m_st == \old(m_st) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || 2 <= t2_st) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || 0 == m_st) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || E_2 == 0) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || ((((((((\result <= 0 && __retres1 <= 0) && ((t1_st == 0 && 2 <= m_st) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st)))) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || t1_st == \old(t1_st)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && (((((((((((((((((!(q_write_ev == q_read_ev) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || t2_st == \old(t2_st)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || E_2 == 0) || !(2 <= \old(m_st))) || E_M == 0) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || T1_E == 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(c_dr_st == 0))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(token == local)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(t1_pc == 1)) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || ((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || (((2 <= t2_st && __retres1 <= 0) && 0 <= __retres1) && t1_st == 0)) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((__retres1 <= 0 && t1_st == \old(t1_st)) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || ((((((((((\result <= 0 && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t1_st == 0) && t2_st == \old(t2_st))) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || E_2 == 0) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || 2 <= t2_st) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || ((((((((((\result <= 0 && __retres1 <= 0) && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || ((((((((((\result <= 0 && __retres1 <= 0) && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || (((((((((2 <= t2_st && \result <= 0) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && t1_st == 0) && 0 <= __retres1)) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && ((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || ((__retres1 <= 0 && 0 <= __retres1) && t1_st == 0)) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(token == local)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((__retres1 <= 0 && t1_st == \old(t1_st)) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && ((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || ((((((((\result <= 0 && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t1_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || ((((((((((2 <= t2_st && \result <= 0) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t1_st == 0) && 2 <= m_st)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(token == local)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1)) [2021-12-17 21:16:11,527 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || ((((((((__retres1 <= 0 && t1_st == \old(t1_st)) && \result <= 0) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st)) && 0 <= \result)) || !(token == local)) || !(t2_pc == 1)) || (((((2 <= t2_st && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && t1_st == 0) && 0 <= \result)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || (m_st == \old(m_st) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(token == local)) || !(t2_pc == 1)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || (m_st == \old(m_st) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((((((((\result <= 0 && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) && \result <= 0) && t1_st == \old(t1_st)) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= \result) && t2_st == \old(t2_st))) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && ((((((((((((((((((((!(q_write_ev == q_read_ev) || ((((((((((((\result <= 0 && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) && 2 <= t2_st) && 0 <= __retres1) && \result <= 0) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && t1_st == 0) && 0 <= \result) && 2 <= m_st)) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || E_2 == 0) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || ((((((((\result <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && 0 <= \result) && __retres1 <= 0) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && tmp___0 <= 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || E_2 == 0) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || ((((((((((\result <= 0 && __retres1 <= 0) && ((t1_st == 0 && 2 <= m_st) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st)))) && 0 <= __retres1) && \result <= 0) && 0 <= \result) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && 0 <= \result)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || ((((((((((\result <= 0 && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t1_st == 0) && 0 <= \result)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && (((((((((((((((((!(q_write_ev == q_read_ev) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || (t1_st == \old(t1_st) && t2_st == \old(t2_st))) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(token == local)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || (m_st == \old(m_st) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || 2 <= t2_st) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || 0 == m_st) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || t1_st == \old(t1_st)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && ((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || E_2 == 0) || !(2 <= \old(m_st))) || E_M == 0) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || T1_E == 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(c_dr_st == 0))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(token == local)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(t1_pc == 1)) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || ((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && ((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || E_2 == 0) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || 2 <= t2_st) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || E_M == 0) || ((((((((((((\result <= 0 && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) && \result <= 0) && t1_st == \old(t1_st)) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= \result) && t2_st == \old(t2_st))) || !(t1_pc == 1)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || (((((((((((\result <= 0 && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 == m_st) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && 0 <= \result) && 2 <= t1_st)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || (((((((((((2 <= t2_st && \result <= 0) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && t1_st == 0) && 0 <= __retres1) && 0 <= \result)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || ((((((((((((\result <= 0 && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) && 2 <= t2_st) && 0 <= __retres1) && \result <= 0) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && t1_st == 0) && 0 <= \result) && 2 <= m_st)) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || ((((((((__retres1 <= 0 && t1_st == \old(t1_st)) && \result <= 0) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st)) && 0 <= \result)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || (((((2 <= t2_st && __retres1 <= 0) && \result <= 0) && t1_st == 0) && 0 <= __retres1) && 0 <= \result)) || !(c_dr_st == 0))) && ((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || E_2 == 0) || (((((((((((2 <= t2_st && \result <= 0) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result) && (((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st)) || (0 == m_st && t1_st == 0))) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && 0 <= \result)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || ((((((((((((\result <= 0 && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) && \result <= 0) && t1_st == \old(t1_st)) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= \result) && t2_st == \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || ((((((((__retres1 <= 0 && t1_st == \old(t1_st)) && \result <= 0) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st)) && 0 <= \result)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(token == local)) || ((((__retres1 <= 0 && \result <= 0) && 0 <= __retres1) && t1_st == 0) && 0 <= \result)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || ((((((((((((\result <= 0 && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) && \result <= 0) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && t1_st == 0) && 0 <= \result) && t2_st == \old(t2_st))) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((((((((((\result <= 0 && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) && \result <= 0) && t1_st == \old(t1_st)) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= \result) && t2_st == \old(t2_st))) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(token == local)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || ((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1)) [2021-12-17 21:16:11,585 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 21:16:11,585 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 21:16:11,585 INFO L158 Benchmark]: Toolchain (without parser) took 506502.92ms. Allocated memory was 92.3MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 61.4MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2021-12-17 21:16:11,586 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 92.3MB. Free memory was 49.2MB in the beginning and 49.2MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 21:16:11,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.92ms. Allocated memory is still 92.3MB. Free memory was 61.2MB in the beginning and 62.2MB in the end (delta: -1.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 21:16:11,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.29ms. Allocated memory is still 92.3MB. Free memory was 62.2MB in the beginning and 59.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 21:16:11,586 INFO L158 Benchmark]: Boogie Preprocessor took 40.09ms. Allocated memory is still 92.3MB. Free memory was 59.3MB in the beginning and 56.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 21:16:11,586 INFO L158 Benchmark]: RCFGBuilder took 614.96ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 56.6MB in the beginning and 92.7MB in the end (delta: -36.0MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2021-12-17 21:16:11,587 INFO L158 Benchmark]: TraceAbstraction took 505367.70ms. Allocated memory was 130.0MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 92.1MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2021-12-17 21:16:11,587 INFO L158 Benchmark]: Witness Printer took 103.11ms. Allocated memory is still 3.4GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-17 21:16:11,588 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.22ms. Allocated memory is still 92.3MB. Free memory was 49.2MB in the beginning and 49.2MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.92ms. Allocated memory is still 92.3MB. Free memory was 61.2MB in the beginning and 62.2MB in the end (delta: -1.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.29ms. Allocated memory is still 92.3MB. Free memory was 62.2MB in the beginning and 59.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.09ms. Allocated memory is still 92.3MB. Free memory was 59.3MB in the beginning and 56.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 614.96ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 56.6MB in the beginning and 92.7MB in the end (delta: -36.0MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * TraceAbstraction took 505367.70ms. Allocated memory was 130.0MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 92.1MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 103.11ms. Allocated memory is still 3.4GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. 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: 599]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 27]: 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 15 procedures, 249 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 505.2s, OverallIterations: 37, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 24.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 455.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18657 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18264 mSDsluCounter, 32099 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19422 mSDsCounter, 3713 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13693 IncrementalHoareTripleChecker+Invalid, 17406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3713 mSolverCounterUnsat, 12677 mSDtfsCounter, 13693 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4314 GetRequests, 3898 SyntacticMatches, 6 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14402occurred in iteration=33, InterpolantAutomatonStates: 317, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.5s AutomataMinimizationTime, 37 MinimizatonAttempts, 4282 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 95 LocationsWithAnnotation, 27724 PreInvPairs, 37290 NumberOfFragments, 39059 HoareAnnotationTreeSize, 27724 FomulaSimplifications, 112423 FormulaSimplificationTreeSizeReduction, 384.1s HoareSimplificationTime, 95 FomulaSimplificationsInter, 18751417 FormulaSimplificationTreeSizeReductionInter, 70.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 7818 NumberOfCodeBlocks, 7818 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 7762 ConstructedInterpolants, 0 QuantifiedInterpolants, 13832 SizeOfPredicates, 6 NumberOfNonLiveVariables, 10641 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 56 InterpolantComputations, 37 PerfectInterpolantSequences, 4086/4440 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 2 specifications checked. All of them hold - InvariantResult [Line: 1102]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= m_st) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_pc == 1) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0) && 2 <= t1_st)) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && (1 <= t1_pc || 0 < m_pc)) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0)) || (((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((2 <= T1_E && local + 1 <= token) && token <= local + 1) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((2 <= T1_E && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0)) || ((((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && 2 <= t2_st) && t2_pc == 1) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t1_pc == 1) && 2 <= t1_st)) || ((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || ((((((((((((((((((token == local && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_st == 0)) || ((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && local + 1 < token) && 0 == m_st) && token <= local + 2) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st)) || ((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && t2_pc <= 0) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0) && 2 <= m_st) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: (((((((((((((((1 < m_pc || m_pc <= 0) && !(0 == p_dw_st)) && t1_pc == m_pc) && !(E_1 == 0)) && 2 == M_E) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && !(1 == p_dw_pc)) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) || c_dr_pc == 1) || (((((((((((((c_dr_pc <= 0 && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && 2 == M_E) && 2 <= T2_E) && 2 <= E_1) && c_dr_st == 0) && t1_pc <= 0) && 0 == m_st) && c_dr_i == 1) && t2_pc <= 0) && t1_st == 0) - InvariantResult [Line: 672]: Loop Invariant Derived loop invariant: ((((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= m_st) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && (1 <= t1_pc || 0 < m_pc)) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0)) || ((((((((((((!(E_1 == 0) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && (1 <= t1_pc || 0 < m_pc)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && 2 <= m_st)) || (((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= m_st) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: ((((((((((((((((E_1 == 0 || 1 == p_dw_pc) || E_2 == 0) || !(c_dr_i == 1)) || !(2 == q_read_ev)) || E_M == 0) || 0 == p_dw_st) || !(t1_pc == m_pc)) || T1_E == 0) || (!(m_pc <= 0) && !(1 < m_pc))) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 == M_E)) || (0 <= __retres1 && __retres1 <= 0)) || !(c_dr_st == 0)) && ((((((((((((((((!(p_dw_pc == 1) || !(c_dr_pc <= 0)) || !(t1_pc <= 0)) || !(c_dr_i == 1)) || !(t2_pc <= 0)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(0 == m_st)) || !(t1_st == 0)) || !(2 <= T1_E)) || !(2 <= E_2)) || !(2 <= fast_clk_edge)) || !(2 <= T2_E)) || !(2 == M_E)) || (0 <= __retres1 && __retres1 <= 0)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((1 == p_dw_pc || !(c_dr_pc <= 0)) || !(t1_pc <= 0)) || !(c_dr_i == 1)) || !(2 == q_read_ev)) || !(t2_pc <= 0)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(0 == m_st)) || !(t1_st == 0)) || !(2 <= T1_E)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(2 == M_E)) || (0 <= __retres1 && __retres1 <= 0)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((1 == p_dw_pc || !(c_dr_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 == q_read_ev)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (p_dw_pc == 1 && c_dr_pc == 1) || (((((((((((((((c_dr_pc <= 0 && !(0 == p_dw_st)) && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && 2 == M_E) && 2 <= T2_E) && 2 <= E_1) && c_dr_st == 0) && t1_pc <= 0) && 0 == m_st) && p_dw_pc == 1) && c_dr_i == 1) && t2_pc <= 0) && t1_st == 0) - InvariantResult [Line: 1129]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= m_st) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_pc == 1) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0) && 2 <= t1_st)) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && (1 <= t1_pc || 0 < m_pc)) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0)) || (((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((2 <= T1_E && local + 1 <= token) && token <= local + 1) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((2 <= T1_E && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0)) || ((((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && 2 <= t2_st) && t2_pc == 1) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t1_pc == 1) && 2 <= t1_st)) || ((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || ((((((((((((((((((token == local && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_st == 0)) || ((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && local + 1 < token) && 0 == m_st) && token <= local + 2) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st)) || ((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && t2_pc <= 0) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0) && 2 <= m_st) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((((((((((((((1 < m_pc || m_pc <= 0) && !(0 == p_dw_st)) && t1_pc == m_pc) && !(E_1 == 0)) && 2 == M_E) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && !(1 == p_dw_pc)) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) || c_dr_pc == 1) || (((((((((((((c_dr_pc <= 0 && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && 2 == M_E) && 2 <= T2_E) && 2 <= E_1) && c_dr_st == 0) && t1_pc <= 0) && 0 == m_st) && c_dr_i == 1) && t2_pc <= 0) && t1_st == 0) - InvariantResult [Line: 484]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((((((((((((((E_1 == 0 || !(c_dr_pc == \old(q_req_up))) || 1 == p_dw_pc) || E_2 == 0) || !(c_dr_i == 1)) || !(2 == \old(q_read_ev))) || E_M == 0) || 0 == p_dw_st) || !(t1_pc == m_pc)) || T1_E == 0) || !(0 == \old(q_req_up))) || (!(m_pc <= 0) && !(1 < m_pc))) || !(2 == M_E)) || !(c_dr_st == 0)) && ((((((((((((((!(c_dr_pc <= 0) || !(t1_pc <= 0)) || !(c_dr_i == 1)) || 0 == q_req_up) || !(t2_pc <= 0)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(0 == m_st)) || !(t1_st == 0)) || !(2 <= T1_E)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(2 == M_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((!(c_dr_pc <= 0) || !(t1_pc <= 0)) || !(c_dr_i == 1)) || !(t2_pc <= 0)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(0 == m_st)) || !(t1_st == 0)) || !(0 == \old(q_req_up))) || !(2 <= T1_E)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(2 == M_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (!(0 == \old(q_req_up)) || !(c_dr_pc == 1))) && (!(c_dr_pc == 1) || 0 == q_req_up) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= m_st) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_pc == 1) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0) && 2 <= t1_st)) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && (1 <= t1_pc || 0 < m_pc)) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0)) || (((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((2 <= T1_E && local + 1 <= token) && token <= local + 1) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((2 <= T1_E && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0)) || ((((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && 2 <= t2_st) && t2_pc == 1) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t1_pc == 1) && 2 <= t1_st)) || ((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || ((((((((((((((((((token == local && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_st == 0)) || ((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && local + 1 < token) && 0 == m_st) && token <= local + 2) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st)) || ((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && t2_pc <= 0) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0) && 2 <= m_st) - InvariantResult [Line: 782]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || (m_st == \old(m_st) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(token == local)) || !(t2_pc == 1)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || (m_st == \old(m_st) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || t1_st == \old(t1_st)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || ((((((((((\result <= 0 && __retres1 <= 0) && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || E_M == 0) || !(t1_pc == 1)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || (((((((((\result <= 0 && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 == m_st) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && 2 <= t1_st)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || ((((((((((\result <= 0 && __retres1 <= 0) && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || E_2 == 0) || (((((((((2 <= t2_st && \result <= 0) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && (((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st)) || (0 == m_st && t1_st == 0))) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((((__retres1 <= 0 && t1_st == \old(t1_st)) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || (((2 <= t2_st && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && ((((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || E_2 == 0) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || ((((((((((2 <= t2_st && \result <= 0) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t1_st == 0) && 2 <= m_st)) || ((((((((\result <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && 0 <= \result) && __retres1 <= 0) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && tmp___0 <= 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(token == local)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || (m_st == \old(m_st) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || 2 <= t2_st) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || 0 == m_st) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || E_2 == 0) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || ((((((((\result <= 0 && __retres1 <= 0) && ((t1_st == 0 && 2 <= m_st) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st)))) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || t1_st == \old(t1_st)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && (((((((((((((((((!(q_write_ev == q_read_ev) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || t2_st == \old(t2_st)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || E_2 == 0) || !(2 <= \old(m_st))) || E_M == 0) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || T1_E == 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(c_dr_st == 0))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(token == local)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(t1_pc == 1)) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || ((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || (((2 <= t2_st && __retres1 <= 0) && 0 <= __retres1) && t1_st == 0)) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((__retres1 <= 0 && t1_st == \old(t1_st)) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || ((((((((((\result <= 0 && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t1_st == 0) && t2_st == \old(t2_st))) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || E_2 == 0) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || 2 <= t2_st) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || ((((((((((\result <= 0 && __retres1 <= 0) && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || ((((((((((\result <= 0 && __retres1 <= 0) && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || (((((((((2 <= t2_st && \result <= 0) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && t1_st == 0) && 0 <= __retres1)) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && ((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || ((__retres1 <= 0 && 0 <= __retres1) && t1_st == 0)) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(token == local)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((__retres1 <= 0 && t1_st == \old(t1_st)) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && ((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || ((((((((\result <= 0 && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t1_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || ((((((((((2 <= t2_st && \result <= 0) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t1_st == 0) && 2 <= m_st)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(token == local)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1)) - InvariantResult [Line: 832]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 763]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((t1_st == \old(t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1)) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || (0 <= __retres1 && __retres1 <= 0)) || !(token == local)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(token == local)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || ((((0 <= __retres1 && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((t1_st == \old(t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && ((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || E_2 == 0) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(2 <= \old(m_st))) || E_M == 0) || T1_E == 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(c_dr_st == 0))) && ((((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || (((0 <= __retres1 && 0 == m_st) && __retres1 <= 0) && 2 <= t1_st)) || !(t1_i == 1)) || E_M == 0) || !(t1_pc == 1)) || ((((t1_st == \old(t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || E_2 == 0) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((t1_st == \old(t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || ((((0 <= __retres1 && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((t1_st == \old(t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || ((((0 <= __retres1 && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc <= 0)) || !(t1_i == 1)) || ((((0 <= __retres1 && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && (((((((((((((((((!(q_write_ev == q_read_ev) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || E_2 == 0) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((t1_st == \old(t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || (0 <= __retres1 && __retres1 <= 0)) || !(t2_pc == 1)) || !(token == local)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(t1_pc == 1)) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && (((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || E_2 == 0) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || ((((t1_st == \old(t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(token == local)) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(token == local)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: (((((((((((((((1 < m_pc || m_pc <= 0) && !(0 == p_dw_st)) && t1_pc == m_pc) && !(E_1 == 0)) && 2 == M_E) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && !(1 == p_dw_pc)) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) || c_dr_pc == 1) || (((((((((((((c_dr_pc <= 0 && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && 2 == M_E) && 2 <= T2_E) && 2 <= E_1) && c_dr_st == 0) && t1_pc <= 0) && 0 == m_st) && c_dr_i == 1) && t2_pc <= 0) && t1_st == 0) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= T1_E && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && 2 == M_E) && 2 <= fast_clk_edge) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && 2 <= slow_clk_edge) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_i == 1) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0) && 2 == q_read_ev) || (((((((((((((((1 < m_pc || m_pc <= 0) && !(0 == p_dw_st)) && t1_pc == m_pc) && !(E_1 == 0)) && 2 == M_E) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) - InvariantResult [Line: 1117]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 669]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= m_st) || (((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_pc == 1) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0) && 2 <= t1_st)) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && (1 <= t1_pc || 0 < m_pc)) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0)) || ((((((((((((!(E_1 == 0) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && (1 <= t1_pc || 0 < m_pc)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && 2 <= m_st)) || (((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((2 <= T1_E && local + 1 <= token) && token <= local + 1) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st) && 2 <= m_st)) || ((((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_pc == 1) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && 2 <= t1_st)) || ((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= t1_st) && 2 <= m_st) - InvariantResult [Line: 705]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_st == 0) && 2 <= m_st) || (((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && t1_st == 0) && 2 <= m_st)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || ((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && local + 1 < token) && 0 == m_st) && token <= local + 2) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st)) || ((((((((((((((((((token == local && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_st == 0)) || (((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 2 <= t1_st) && 2 <= m_st)) || ((((((((((((((((((token == local && (1 < m_pc || m_pc <= 0)) && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && 2 <= t2_st) && t2_pc == 1) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st) - InvariantResult [Line: 708]: Loop Invariant Derived loop invariant: ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st) || (((((((((((((((((2 <= T1_E && local + 1 <= token) && token <= local + 1) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st) && 2 <= m_st) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 672]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= m_st) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && !(T1_E == 0)) && c_dr_pc == q_req_up) && 2 <= m_st)) || ((((((((((((((((((2 <= T1_E && local + 1 <= token) && 2 <= E_2) && token <= local + 1) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && !(T1_E == 0)) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= m_st)) || (((((((((((((((((((2 <= T1_E && (1 < m_pc || m_pc <= 0)) && 2 <= E_2) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0)) || ((((((((((((((((((((token == local && 2 <= T1_E) && (1 < m_pc || m_pc <= 0)) && 2 <= E_2) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && 0 == m_st) && c_dr_pc == q_req_up)) || (((((((((((((((((((token == local && 2 <= T1_E) && (1 < m_pc || m_pc <= 0)) && 2 <= E_2) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= m_st) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_pc == 1) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0) && 2 <= t1_st)) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && (1 <= t1_pc || 0 < m_pc)) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0)) || (((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((2 <= T1_E && local + 1 <= token) && token <= local + 1) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((2 <= T1_E && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0)) || ((((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && 2 <= t2_st) && t2_pc == 1) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t1_pc == 1) && 2 <= t1_st)) || ((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || ((((((((((((((((((token == local && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_st == 0)) || ((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && local + 1 < token) && 0 == m_st) && token <= local + 2) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st)) || ((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && t2_pc <= 0) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0) && 2 <= m_st) - InvariantResult [Line: 595]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((((((((((1 < m_pc || m_pc <= 0) && !(0 == p_dw_st)) && t1_pc == m_pc) && !(E_1 == 0)) && 2 == M_E) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && !(1 == p_dw_pc)) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) || c_dr_pc == 1) || (((((((((((((c_dr_pc <= 0 && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && 2 == M_E) && 2 <= T2_E) && 2 <= E_1) && c_dr_st == 0) && t1_pc <= 0) && 0 == m_st) && c_dr_i == 1) && t2_pc <= 0) && t1_st == 0) - InvariantResult [Line: 628]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && (1 <= t1_pc || 0 < m_pc)) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0) || ((((((((((((((((2 <= T1_E && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_st == 0)) || (((((((((((((((((token == local && 2 <= T1_E) && (1 < m_pc || m_pc <= 0)) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && 2 <= E_1) && 2 <= T2_E) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && t1_pc == 1) && c_dr_pc == q_req_up) && 2 <= t1_st)) || (((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && local + 1 < token) && token <= local + 2) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st)) || (((((((((((((((2 <= T1_E && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0)) || ((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0) && 2 <= t1_st) - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: (((((((((((((((1 < m_pc || m_pc <= 0) && !(0 == p_dw_st)) && t1_pc == m_pc) && !(E_1 == 0)) && 2 == M_E) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && !(1 == p_dw_pc)) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) || c_dr_pc == 1) || (((((((((((((c_dr_pc <= 0 && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && 2 == M_E) && 2 <= T2_E) && 2 <= E_1) && c_dr_st == 0) && t1_pc <= 0) && 0 == m_st) && c_dr_i == 1) && t2_pc <= 0) && t1_st == 0) - InvariantResult [Line: 543]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= T1_E && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && 2 == M_E) && 2 <= fast_clk_edge) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && 2 <= slow_clk_edge) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_i == 1) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0) && 2 == q_read_ev - InvariantResult [Line: 708]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && 2 <= E_1) && 2 <= T2_E) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && local + 1 < token) && 0 == m_st) && token <= local + 2) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && 2 <= m_st) && 2 <= t1_st)) || ((((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && t1_pc == 1) && t1_st == 0) && 2 <= m_st)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || ((((((((((((((((token == local && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_st == 0)) || ((((((((((((((((token == local && 2 <= T1_E) && (1 < m_pc || m_pc <= 0)) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st)) || (((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && t1_st == 0) && 2 <= m_st) - InvariantResult [Line: 625]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= m_st) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && t1_st == 0) && 2 <= m_st)) || ((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && t2_pc <= 0) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0) && 2 <= m_st)) || ((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= t1_st) && 2 <= m_st) - InvariantResult [Line: 469]: Loop Invariant Derived loop invariant: (((((((((((((((1 < m_pc || m_pc <= 0) && !(0 == p_dw_st)) && t1_pc == m_pc) && !(E_1 == 0)) && 2 == M_E) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && !(1 == p_dw_pc)) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) || c_dr_pc == 1) || (((((((((((((c_dr_pc <= 0 && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && 2 == M_E) && 2 <= T2_E) && 2 <= E_1) && c_dr_st == 0) && t1_pc <= 0) && 0 == m_st) && c_dr_i == 1) && t2_pc <= 0) && t1_st == 0) - InvariantResult [Line: 854]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= m_st) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_pc == 1) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0) && 2 <= t1_st)) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && (1 <= t1_pc || 0 < m_pc)) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0)) || (((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((2 <= T1_E && local + 1 <= token) && token <= local + 1) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((2 <= T1_E && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0)) || ((((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && 2 <= t2_st) && t2_pc == 1) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t1_pc == 1) && 2 <= t1_st)) || ((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || ((((((((((((((((((token == local && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_st == 0)) || ((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && local + 1 < token) && 0 == m_st) && token <= local + 2) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st)) || ((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && t2_pc <= 0) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0) && 2 <= m_st) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: c_dr_pc == 1 - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((c_dr_pc == 1 && c_dr_pc == q_req_up) || (((((((((((((((c_dr_pc <= 0 && !(0 == p_dw_st)) && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && 2 == M_E) && 2 <= T2_E) && 2 <= E_1) && c_dr_st == 0) && !(1 == p_dw_pc)) && t1_pc <= 0) && 0 == m_st) && c_dr_i == 1) && t2_pc <= 0) && t1_st == 0)) || (!(1 == p_dw_pc) && c_dr_pc == 1)) || (((((((((((((((c_dr_pc <= 0 && !(0 == p_dw_st)) && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && 2 == M_E) && 2 <= T2_E) && 2 <= E_1) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && 0 == m_st) && c_dr_i == 1) && t2_pc <= 0) && t1_st == 0) - InvariantResult [Line: 1176]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1098]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= m_st) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_pc == 1) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0) && 2 <= t1_st)) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && (1 <= t1_pc || 0 < m_pc)) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0)) || (((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((2 <= T1_E && local + 1 <= token) && token <= local + 1) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((2 <= T1_E && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0)) || ((((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && 2 <= t2_st) && t2_pc == 1) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t1_pc == 1) && 2 <= t1_st)) || ((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || ((((((((((((((((((token == local && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_st == 0)) || ((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && local + 1 < token) && 0 == m_st) && token <= local + 2) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st)) || ((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && t2_pc <= 0) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0) && 2 <= m_st) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1087]: Loop Invariant Derived loop invariant: (((((((((((((((((token == local && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && 2 == M_E) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0 - InvariantResult [Line: 741]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && \result <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0)) && ((((((((((((((!(q_write_ev == q_read_ev) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || E_2 == 0) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || E_M == 0) || !(t1_pc == 1)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && \result <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || E_2 == 0) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || E_2 == 0) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || E_1 == 0) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && ((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || E_2 == 0) || !(2 <= \old(m_st))) || E_M == 0) || T1_E == 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(c_dr_st == 0))) && (((((((((((((((((!(q_write_ev == q_read_ev) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || E_1 == 0) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(token == local)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && ((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && \result <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && \result <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || ((((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && t2_st == \old(t2_st))) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st))) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || ((((((((((((((c_dr_pc <= 0 && !(0 == p_dw_st)) && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && 2 == M_E) && 2 <= T2_E) && 2 <= E_1) && c_dr_st == 0) && t1_pc <= 0) && 0 == m_st) && c_dr_i == 1) && t2_pc <= 0) && t1_st == 0) - InvariantResult [Line: 806]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= T1_E && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && 2 == M_E) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0) || ((((((((((((((1 < m_pc || m_pc <= 0) && t1_pc == m_pc) && !(E_1 == 0)) && 2 == M_E) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && 2 <= m_st)) || ((((((((((((((((((token == local && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && 2 == M_E) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0) - InvariantResult [Line: 628]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && local + 1 < token) && token <= local + 2) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: (((((((((((((((1 < m_pc || m_pc <= 0) && !(0 == p_dw_st)) && t1_pc == m_pc) && !(E_1 == 0)) && 2 == M_E) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && !(1 == p_dw_pc)) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) || c_dr_pc == 1) || (((((((((((((c_dr_pc <= 0 && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && 2 == M_E) && 2 <= T2_E) && 2 <= E_1) && c_dr_st == 0) && t1_pc <= 0) && 0 == m_st) && c_dr_i == 1) && t2_pc <= 0) && t1_st == 0) - InvariantResult [Line: 779]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || ((((((((__retres1 <= 0 && t1_st == \old(t1_st)) && \result <= 0) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st)) && 0 <= \result)) || !(token == local)) || !(t2_pc == 1)) || (((((2 <= t2_st && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && t1_st == 0) && 0 <= \result)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || (m_st == \old(m_st) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(token == local)) || !(t2_pc == 1)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || (m_st == \old(m_st) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((((((((\result <= 0 && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) && \result <= 0) && t1_st == \old(t1_st)) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= \result) && t2_st == \old(t2_st))) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && ((((((((((((((((((((!(q_write_ev == q_read_ev) || ((((((((((((\result <= 0 && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) && 2 <= t2_st) && 0 <= __retres1) && \result <= 0) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && t1_st == 0) && 0 <= \result) && 2 <= m_st)) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || E_2 == 0) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || ((((((((\result <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && 0 <= \result) && __retres1 <= 0) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && tmp___0 <= 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || E_2 == 0) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || ((((((((((\result <= 0 && __retres1 <= 0) && ((t1_st == 0 && 2 <= m_st) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st)))) && 0 <= __retres1) && \result <= 0) && 0 <= \result) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && 0 <= \result)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || ((((((((((\result <= 0 && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t1_st == 0) && 0 <= \result)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && (((((((((((((((((!(q_write_ev == q_read_ev) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || (t1_st == \old(t1_st) && t2_st == \old(t2_st))) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(token == local)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || (m_st == \old(m_st) && t2_st == \old(t2_st))) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || 2 <= t2_st) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || 0 == m_st) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || t1_st == \old(t1_st)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && ((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || E_2 == 0) || !(2 <= \old(m_st))) || E_M == 0) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || T1_E == 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(c_dr_st == 0))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(token == local)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(t1_pc == 1)) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || ((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && ((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || E_2 == 0) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || 2 <= t2_st) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || E_M == 0) || ((((((((((((\result <= 0 && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) && \result <= 0) && t1_st == \old(t1_st)) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= \result) && t2_st == \old(t2_st))) || !(t1_pc == 1)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || (((((((((((\result <= 0 && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 == m_st) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && 0 <= \result) && 2 <= t1_st)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || (((((((((((2 <= t2_st && \result <= 0) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && t1_st == 0) && 0 <= __retres1) && 0 <= \result)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || ((((((((((((\result <= 0 && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) && 2 <= t2_st) && 0 <= __retres1) && \result <= 0) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && t1_st == 0) && 0 <= \result) && 2 <= m_st)) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || ((((((((__retres1 <= 0 && t1_st == \old(t1_st)) && \result <= 0) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st)) && 0 <= \result)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || (((((2 <= t2_st && __retres1 <= 0) && \result <= 0) && t1_st == 0) && 0 <= __retres1) && 0 <= \result)) || !(c_dr_st == 0))) && ((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || E_2 == 0) || (((((((((((2 <= t2_st && \result <= 0) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result) && (((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st)) || (0 == m_st && t1_st == 0))) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && 0 <= \result)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || ((((((((((((\result <= 0 && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) && \result <= 0) && t1_st == \old(t1_st)) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= \result) && t2_st == \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || ((((((((__retres1 <= 0 && t1_st == \old(t1_st)) && \result <= 0) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= __retres1) && t2_st == \old(t2_st)) && 0 <= \result)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(token == local)) || ((((__retres1 <= 0 && \result <= 0) && 0 <= __retres1) && t1_st == 0) && 0 <= \result)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || ((((((((((((\result <= 0 && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) && \result <= 0) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && t1_st == 0) && 0 <= \result) && t2_st == \old(t2_st))) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || ((((((((((((\result <= 0 && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) && \result <= 0) && t1_st == \old(t1_st)) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 < tmp___0 + 1) && tmp___0 <= 0) && 0 <= \result) && t2_st == \old(t2_st))) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(token == local)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || ((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1)) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((((((((E_1 == 0 || 1 == p_dw_pc) || E_2 == 0) || !(c_dr_i == 1)) || !(2 == q_read_ev)) || E_M == 0) || 0 == p_dw_st) || !(t1_pc == m_pc)) || T1_E == 0) || (!(m_pc <= 0) && !(1 < m_pc))) || !(0 == q_req_up)) || !(c_dr_pc == q_req_up)) || !(2 == M_E)) || (0 <= __retres1 && __retres1 <= 0)) || !(c_dr_st == 0)) && ((((((((((((((!(c_dr_pc <= 0) || !(t1_pc <= 0)) || !(c_dr_i == 1)) || !(t2_pc <= 0)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(0 == m_st)) || !(t1_st == 0)) || !(2 <= T1_E)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(2 == M_E)) || (0 <= __retres1 && __retres1 <= 0)) || !(c_dr_st == 0)) || !(2 <= E_1)) - InvariantResult [Line: 760]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(token == local)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || ((((((\result <= 0 && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0)) || !(2 <= E_1)) && ((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || E_2 == 0) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(2 <= \old(m_st))) || E_M == 0) || T1_E == 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(c_dr_st == 0))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || ((((((\result <= 0 && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || ((((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || E_2 == 0) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || ((((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || ((((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || ((((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || ((((((\result <= 0 && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0))) && ((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || ((((((\result <= 0 && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && t2_st == \old(t2_st))) || !(c_dr_st == 0))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(token == local)) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || (((\result <= 0 && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || E_2 == 0) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || ((((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || E_M == 0) || (((((\result <= 0 && 0 <= __retres1) && 0 <= \result) && 0 == m_st) && __retres1 <= 0) && 2 <= t1_st)) || !(t1_pc == 1)) || !(p_dw_st == 0)) || ((((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || E_2 == 0) || ((((((((((((((1 < m_pc || m_pc <= 0) && !(E_1 == 0)) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && t2_st == \old(t2_st)) && 2 <= m_st)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || ((((((\result <= 0 && t1_st == \old(t1_st)) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0) && t2_st == \old(t2_st))) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(token == local)) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || !(token == local)) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(t1_pc == 1)) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(2 <= T2_E)) || (((\result <= 0 && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st)))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(token == local)) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((((((((((1 < m_pc || m_pc <= 0) && !(0 == p_dw_st)) && t1_pc == m_pc) && !(E_1 == 0)) && 2 == M_E) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && !(1 == p_dw_pc)) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) || c_dr_pc == 1) || ((((((((((((((c_dr_pc <= 0 && !(0 == p_dw_st)) && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && 2 == M_E) && 2 <= T2_E) && 2 <= E_1) && c_dr_st == 0) && t1_pc <= 0) && 0 == m_st) && c_dr_i == 1) && t2_pc <= 0) && t1_st == 0) - InvariantResult [Line: 1040]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= m_st) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_pc == 1) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0) && 2 <= t1_st)) || ((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && (1 <= t1_pc || 0 < m_pc)) && 2 <= t2_st) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t2_pc <= 0)) || (((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((2 <= T1_E && local + 1 <= token) && token <= local + 1) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st) && 2 <= m_st)) || (((((((((((((((((2 <= T1_E && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0)) || ((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && 2 <= t1_st) && 2 <= m_st)) || ((((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= E_1) && 2 <= T2_E) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && 2 <= t2_st) && t2_pc == 1) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && ((1 < m_pc && t1_pc <= 1) || m_pc <= 0)) && t1_pc == 1) && 2 <= t1_st)) || (((((((((((((((((token == local && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0)) || ((((((((((((1 < m_pc || m_pc <= 0) && p_dw_pc == q_req_up) && !(E_1 == 0)) && q_write_ev == q_read_ev) && !(T1_E == 0)) && !(E_M == 0)) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && !(E_2 == 0)) && c_dr_st == 0) && 2 <= m_st)) || ((((((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && q_write_ev == q_read_ev) && local + 1 < token) && 0 == m_st) && token <= local + 2) && c_dr_pc == q_req_up) && t1_pc == 1) && 2 <= t1_st)) || ((((((((((((((((((token == local && 2 <= T1_E) && t1_pc == m_pc) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && 2 <= t2_st) && p_dw_pc == q_req_up) && t2_pc == 1) && t1_pc <= 0) && q_write_ev == q_read_ev) && 0 == m_st) && c_dr_pc == q_req_up) && t1_st == 0)) || ((((((((((((((((token == local && 2 <= T1_E) && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_pc == 1) && t2_pc <= 0) && t1_st == 0) && 2 <= m_st)) || (((((((((((((((2 <= T1_E && 2 <= E_2) && 2 <= E_M) && t1_i == 1) && p_dw_st == 0) && 2 <= T2_E) && 2 <= E_1) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t2_pc <= 0) && t1_st == 0) && 2 <= m_st) - InvariantResult [Line: 744]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1)) || !(2 <= \old(t1_st))) && ((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || E_2 == 0) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(2 <= \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || ((((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0) && t2_st == \old(t2_st))) || !(token == local)) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || ((((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0) && t2_st == \old(t2_st))) || !(t2_pc == 1)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || ((t1_st == \old(t1_st) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || E_M == 0) || !(t1_pc == 1)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && (((((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || ((((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0) && t2_st == \old(t2_st))) || !(t2_pc == 1)) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(t2_pc == 1)) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && (((((((((((((((((((!(q_write_ev == q_read_ev) || !(token <= local + 2)) || !(p_dw_pc == q_req_up)) || !(t2_pc == 1)) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(0 == \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(local + 1 < token)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || !(t2_pc == 1)) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) || !(2 <= E_1))) && (((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || !(token == local)) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && ((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(local + 1 <= token)) || !(token <= local + 1)) || E_2 == 0) || !(t2_pc == 1)) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(2 <= \old(m_st))) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(t1_pc <= 0)) || ((((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0) && t2_st == \old(t2_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == m_pc)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= E_2)) || !(2 <= T2_E)) || !(c_dr_st == 0))) && (((((((((((((((((!(q_write_ev == q_read_ev) || (!(1 <= t1_pc) && !(0 < m_pc))) || !(p_dw_pc == q_req_up)) || (!(m_pc <= 0) && (!(t1_pc <= 1) || !(1 < m_pc)))) || E_2 == 0) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(0 == \old(m_st))) || !(t2_pc <= 0)) || !(t1_i == 1)) || !(2 <= \old(t2_st))) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= T2_E)) || !(c_dr_st == 0)) || !(2 <= E_1))) && ((((((((((((!(q_write_ev == q_read_ev) || E_1 == 0) || !(p_dw_pc == q_req_up)) || E_2 == 0) || ((((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && t2_st == \old(t2_st))) || !(2 <= \old(m_st))) || E_M == 0) || T1_E == 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && !(1 < m_pc))) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(c_dr_st == 0)) RESULT: Ultimate proved your program to be correct! [2021-12-17 21:16:11,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE